./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_8.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec 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/locks/test_locks_8.c -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 37d0ed05d77a0379c9ed98058bf2f327252773ce .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-25 20:14:31,045 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-25 20:14:31,048 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-25 20:14:31,088 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-25 20:14:31,089 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-25 20:14:31,092 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-25 20:14:31,093 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-25 20:14:31,099 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-25 20:14:31,101 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-25 20:14:31,105 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-25 20:14:31,107 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-25 20:14:31,110 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-25 20:14:31,111 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-25 20:14:31,113 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-25 20:14:31,115 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-25 20:14:31,118 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-25 20:14:31,119 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-25 20:14:31,119 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-25 20:14:31,122 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-25 20:14:31,128 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-25 20:14:31,129 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-25 20:14:31,130 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-25 20:14:31,133 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-25 20:14:31,133 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-25 20:14:31,139 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-25 20:14:31,140 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-25 20:14:31,140 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-25 20:14:31,142 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-25 20:14:31,142 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-25 20:14:31,143 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-25 20:14:31,143 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-25 20:14:31,144 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-25 20:14:31,145 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-25 20:14:31,146 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-25 20:14:31,147 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-25 20:14:31,147 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-25 20:14:31,148 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-25 20:14:31,148 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-25 20:14:31,148 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-25 20:14:31,150 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-25 20:14:31,150 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-25 20:14:31,154 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-25 20:14:31,202 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-25 20:14:31,202 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-25 20:14:31,203 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-25 20:14:31,203 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-25 20:14:31,205 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-25 20:14:31,205 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-25 20:14:31,206 INFO L138 SettingsManager]: * Use SBE=true [2021-08-25 20:14:31,206 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-25 20:14:31,206 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-25 20:14:31,206 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-25 20:14:31,207 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-25 20:14:31,208 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-25 20:14:31,208 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-25 20:14:31,208 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-25 20:14:31,208 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-25 20:14:31,208 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-25 20:14:31,208 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-25 20:14:31,209 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-25 20:14:31,209 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-25 20:14:31,209 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-25 20:14:31,209 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-25 20:14:31,209 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-25 20:14:31,210 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:14:31,210 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-25 20:14:31,210 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-25 20:14:31,210 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-25 20:14:31,211 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-25 20:14:31,211 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-25 20:14:31,211 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-25 20:14:31,211 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-25 20:14:31,211 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 -> 37d0ed05d77a0379c9ed98058bf2f327252773ce [2021-08-25 20:14:31,575 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-25 20:14:31,600 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-25 20:14:31,602 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-25 20:14:31,604 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-25 20:14:31,604 INFO L275 PluginConnector]: CDTParser initialized [2021-08-25 20:14:31,605 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_8.c [2021-08-25 20:14:31,669 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8da60aab/8a2e90efe9cd4bed9e3236d3964e645d/FLAG4dcfd603e [2021-08-25 20:14:32,138 INFO L306 CDTParser]: Found 1 translation units. [2021-08-25 20:14:32,139 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_8.c [2021-08-25 20:14:32,146 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8da60aab/8a2e90efe9cd4bed9e3236d3964e645d/FLAG4dcfd603e [2021-08-25 20:14:32,165 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8da60aab/8a2e90efe9cd4bed9e3236d3964e645d [2021-08-25 20:14:32,168 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-25 20:14:32,170 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-25 20:14:32,173 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-25 20:14:32,173 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-25 20:14:32,176 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-25 20:14:32,177 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:14:32" (1/1) ... [2021-08-25 20:14:32,177 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d9f7369 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:14:32, skipping insertion in model container [2021-08-25 20:14:32,178 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:14:32" (1/1) ... [2021-08-25 20:14:32,183 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-25 20:14:32,203 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-25 20:14:32,359 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_8.c[3218,3231] [2021-08-25 20:14:32,363 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:14:32,371 INFO L203 MainTranslator]: Completed pre-run [2021-08-25 20:14:32,419 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_8.c[3218,3231] [2021-08-25 20:14:32,428 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:14:32,462 INFO L208 MainTranslator]: Completed translation [2021-08-25 20:14:32,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:14:32 WrapperNode [2021-08-25 20:14:32,464 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-25 20:14:32,465 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-25 20:14:32,466 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-25 20:14:32,466 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-25 20:14:32,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:14:32" (1/1) ... [2021-08-25 20:14:32,484 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:14:32" (1/1) ... [2021-08-25 20:14:32,509 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-25 20:14:32,510 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-25 20:14:32,511 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-25 20:14:32,511 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-25 20:14:32,517 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:14:32" (1/1) ... [2021-08-25 20:14:32,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:14:32" (1/1) ... [2021-08-25 20:14:32,520 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:14:32" (1/1) ... [2021-08-25 20:14:32,521 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:14:32" (1/1) ... [2021-08-25 20:14:32,533 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:14:32" (1/1) ... [2021-08-25 20:14:32,539 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:14:32" (1/1) ... [2021-08-25 20:14:32,543 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:14:32" (1/1) ... [2021-08-25 20:14:32,547 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-25 20:14:32,549 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-25 20:14:32,549 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-25 20:14:32,550 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-25 20:14:32,551 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:14:32" (1/1) ... [2021-08-25 20:14:32,556 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:14:32,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:14:32,590 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-08-25 20:14:32,615 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-08-25 20:14:32,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-25 20:14:32,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-25 20:14:32,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-25 20:14:32,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-25 20:14:32,979 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-25 20:14:32,980 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-08-25 20:14:32,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:14:32 BoogieIcfgContainer [2021-08-25 20:14:32,982 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-25 20:14:32,983 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-25 20:14:32,983 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-25 20:14:32,986 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-25 20:14:32,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 08:14:32" (1/3) ... [2021-08-25 20:14:32,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e669e8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:14:32, skipping insertion in model container [2021-08-25 20:14:32,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:14:32" (2/3) ... [2021-08-25 20:14:32,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e669e8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:14:32, skipping insertion in model container [2021-08-25 20:14:32,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:14:32" (3/3) ... [2021-08-25 20:14:32,989 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2021-08-25 20:14:32,993 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-25 20:14:32,993 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-25 20:14:33,030 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-25 20:14:33,035 INFO L339 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, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-25 20:14:33,035 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-25 20:14:33,049 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 32 states have (on average 1.875) internal successors, (60), 33 states have internal predecessors, (60), 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-08-25 20:14:33,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-25 20:14:33,064 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:14:33,064 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:14:33,065 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:14:33,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:14:33,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1577492323, now seen corresponding path program 1 times [2021-08-25 20:14:33,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:14:33,113 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4234093] [2021-08-25 20:14:33,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:14:33,117 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:14:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:14:33,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:14:33,337 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:14:33,337 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4234093] [2021-08-25 20:14:33,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4234093] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:14:33,338 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:14:33,339 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:14:33,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491181353] [2021-08-25 20:14:33,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:14:33,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:14:33,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:14:33,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:33,363 INFO L87 Difference]: Start difference. First operand has 34 states, 32 states have (on average 1.875) internal successors, (60), 33 states have internal predecessors, (60), 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 5.0) internal successors, (15), 3 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-08-25 20:14:33,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:14:33,409 INFO L93 Difference]: Finished difference Result 71 states and 121 transitions. [2021-08-25 20:14:33,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:14:33,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-08-25 20:14:33,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:14:33,419 INFO L225 Difference]: With dead ends: 71 [2021-08-25 20:14:33,420 INFO L226 Difference]: Without dead ends: 57 [2021-08-25 20:14:33,423 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:33,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-08-25 20:14:33,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 39. [2021-08-25 20:14:33,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 38 states have internal predecessors, (70), 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-08-25 20:14:33,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 70 transitions. [2021-08-25 20:14:33,460 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 70 transitions. Word has length 15 [2021-08-25 20:14:33,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:14:33,462 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 70 transitions. [2021-08-25 20:14:33,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-08-25 20:14:33,463 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 70 transitions. [2021-08-25 20:14:33,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-25 20:14:33,463 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:14:33,464 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:14:33,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-25 20:14:33,464 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:14:33,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:14:33,469 INFO L82 PathProgramCache]: Analyzing trace with hash -876427745, now seen corresponding path program 1 times [2021-08-25 20:14:33,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:14:33,469 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862817170] [2021-08-25 20:14:33,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:14:33,470 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:14:33,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:14:33,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:14:33,562 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:14:33,562 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862817170] [2021-08-25 20:14:33,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862817170] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:14:33,562 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:14:33,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:14:33,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540622659] [2021-08-25 20:14:33,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:14:33,564 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:14:33,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:14:33,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:33,567 INFO L87 Difference]: Start difference. First operand 39 states and 70 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-08-25 20:14:33,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:14:33,608 INFO L93 Difference]: Finished difference Result 94 states and 169 transitions. [2021-08-25 20:14:33,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:14:33,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-08-25 20:14:33,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:14:33,612 INFO L225 Difference]: With dead ends: 94 [2021-08-25 20:14:33,612 INFO L226 Difference]: Without dead ends: 57 [2021-08-25 20:14:33,613 INFO L781 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-08-25 20:14:33,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-08-25 20:14:33,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2021-08-25 20:14:33,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 54 states have internal predecessors, (98), 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-08-25 20:14:33,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 98 transitions. [2021-08-25 20:14:33,633 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 98 transitions. Word has length 15 [2021-08-25 20:14:33,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:14:33,633 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 98 transitions. [2021-08-25 20:14:33,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-08-25 20:14:33,634 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 98 transitions. [2021-08-25 20:14:33,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-25 20:14:33,635 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:14:33,635 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:14:33,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-25 20:14:33,636 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:14:33,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:14:33,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1657407761, now seen corresponding path program 1 times [2021-08-25 20:14:33,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:14:33,650 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195228915] [2021-08-25 20:14:33,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:14:33,651 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:14:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:14:33,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:14:33,706 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:14:33,706 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195228915] [2021-08-25 20:14:33,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195228915] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:14:33,708 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:14:33,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:14:33,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943671880] [2021-08-25 20:14:33,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:14:33,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:14:33,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:14:33,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:33,716 INFO L87 Difference]: Start difference. First operand 55 states and 98 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-08-25 20:14:33,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:14:33,738 INFO L93 Difference]: Finished difference Result 87 states and 150 transitions. [2021-08-25 20:14:33,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:14:33,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) Word has length 16 [2021-08-25 20:14:33,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:14:33,741 INFO L225 Difference]: With dead ends: 87 [2021-08-25 20:14:33,741 INFO L226 Difference]: Without dead ends: 60 [2021-08-25 20:14:33,742 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:33,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-08-25 20:14:33,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2021-08-25 20:14:33,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.7543859649122806) internal successors, (100), 57 states have internal predecessors, (100), 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-08-25 20:14:33,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 100 transitions. [2021-08-25 20:14:33,753 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 100 transitions. Word has length 16 [2021-08-25 20:14:33,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:14:33,753 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 100 transitions. [2021-08-25 20:14:33,753 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-08-25 20:14:33,754 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 100 transitions. [2021-08-25 20:14:33,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-25 20:14:33,754 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:14:33,755 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:14:33,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-25 20:14:33,756 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:14:33,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:14:33,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1399242323, now seen corresponding path program 1 times [2021-08-25 20:14:33,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:14:33,757 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034261274] [2021-08-25 20:14:33,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:14:33,757 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:14:33,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:14:33,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:14:33,832 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:14:33,832 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034261274] [2021-08-25 20:14:33,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034261274] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:14:33,834 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:14:33,834 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:14:33,834 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598244018] [2021-08-25 20:14:33,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:14:33,835 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:14:33,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:14:33,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:33,837 INFO L87 Difference]: Start difference. First operand 58 states and 100 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-08-25 20:14:33,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:14:33,858 INFO L93 Difference]: Finished difference Result 109 states and 189 transitions. [2021-08-25 20:14:33,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:14:33,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) Word has length 16 [2021-08-25 20:14:33,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:14:33,863 INFO L225 Difference]: With dead ends: 109 [2021-08-25 20:14:33,863 INFO L226 Difference]: Without dead ends: 107 [2021-08-25 20:14:33,864 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:33,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-08-25 20:14:33,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 77. [2021-08-25 20:14:33,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.75) internal successors, (133), 76 states have internal predecessors, (133), 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-08-25 20:14:33,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 133 transitions. [2021-08-25 20:14:33,871 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 133 transitions. Word has length 16 [2021-08-25 20:14:33,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:14:33,871 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 133 transitions. [2021-08-25 20:14:33,871 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-08-25 20:14:33,871 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 133 transitions. [2021-08-25 20:14:33,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-25 20:14:33,872 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:14:33,872 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:14:33,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-25 20:14:33,873 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:14:33,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:14:33,873 INFO L82 PathProgramCache]: Analyzing trace with hash -698177745, now seen corresponding path program 1 times [2021-08-25 20:14:33,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:14:33,874 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127230373] [2021-08-25 20:14:33,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:14:33,874 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:14:33,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:14:33,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:14:33,912 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:14:33,912 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127230373] [2021-08-25 20:14:33,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127230373] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:14:33,913 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:14:33,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:14:33,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752611514] [2021-08-25 20:14:33,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:14:33,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:14:33,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:14:33,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:33,915 INFO L87 Difference]: Start difference. First operand 77 states and 133 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-08-25 20:14:33,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:14:33,928 INFO L93 Difference]: Finished difference Result 181 states and 315 transitions. [2021-08-25 20:14:33,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:14:33,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) Word has length 16 [2021-08-25 20:14:33,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:14:33,929 INFO L225 Difference]: With dead ends: 181 [2021-08-25 20:14:33,930 INFO L226 Difference]: Without dead ends: 109 [2021-08-25 20:14:33,930 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:33,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-08-25 20:14:33,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2021-08-25 20:14:33,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.7264150943396226) internal successors, (183), 106 states have internal predecessors, (183), 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-08-25 20:14:33,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 183 transitions. [2021-08-25 20:14:33,938 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 183 transitions. Word has length 16 [2021-08-25 20:14:33,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:14:33,938 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 183 transitions. [2021-08-25 20:14:33,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-08-25 20:14:33,938 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 183 transitions. [2021-08-25 20:14:33,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-25 20:14:33,939 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:14:33,939 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:14:33,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-25 20:14:33,940 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:14:33,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:14:33,940 INFO L82 PathProgramCache]: Analyzing trace with hash -426624716, now seen corresponding path program 1 times [2021-08-25 20:14:33,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:14:33,941 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254304190] [2021-08-25 20:14:33,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:14:33,941 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:14:33,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:14:33,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:14:33,979 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:14:33,979 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254304190] [2021-08-25 20:14:33,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254304190] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:14:33,980 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:14:33,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:14:33,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557883278] [2021-08-25 20:14:33,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:14:33,981 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:14:33,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:14:33,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:33,982 INFO L87 Difference]: Start difference. First operand 107 states and 183 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-08-25 20:14:33,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:14:33,993 INFO L93 Difference]: Finished difference Result 162 states and 274 transitions. [2021-08-25 20:14:33,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:14:33,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2021-08-25 20:14:33,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:14:33,997 INFO L225 Difference]: With dead ends: 162 [2021-08-25 20:14:33,997 INFO L226 Difference]: Without dead ends: 111 [2021-08-25 20:14:33,998 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:33,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-08-25 20:14:34,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2021-08-25 20:14:34,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.6944444444444444) internal successors, (183), 108 states have internal predecessors, (183), 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-08-25 20:14:34,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 183 transitions. [2021-08-25 20:14:34,009 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 183 transitions. Word has length 17 [2021-08-25 20:14:34,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:14:34,009 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 183 transitions. [2021-08-25 20:14:34,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-08-25 20:14:34,009 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 183 transitions. [2021-08-25 20:14:34,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-25 20:14:34,011 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:14:34,011 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:14:34,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-25 20:14:34,011 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:14:34,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:14:34,012 INFO L82 PathProgramCache]: Analyzing trace with hash -168459278, now seen corresponding path program 1 times [2021-08-25 20:14:34,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:14:34,012 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984492226] [2021-08-25 20:14:34,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:14:34,013 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:14:34,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:14:34,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:14:34,057 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:14:34,058 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984492226] [2021-08-25 20:14:34,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984492226] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:14:34,058 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:14:34,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:14:34,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284074382] [2021-08-25 20:14:34,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:14:34,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:14:34,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:14:34,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:34,060 INFO L87 Difference]: Start difference. First operand 109 states and 183 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-08-25 20:14:34,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:14:34,077 INFO L93 Difference]: Finished difference Result 309 states and 521 transitions. [2021-08-25 20:14:34,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:14:34,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2021-08-25 20:14:34,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:14:34,079 INFO L225 Difference]: With dead ends: 309 [2021-08-25 20:14:34,079 INFO L226 Difference]: Without dead ends: 207 [2021-08-25 20:14:34,079 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:34,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-08-25 20:14:34,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 205. [2021-08-25 20:14:34,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.661764705882353) internal successors, (339), 204 states have internal predecessors, (339), 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-08-25 20:14:34,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 339 transitions. [2021-08-25 20:14:34,104 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 339 transitions. Word has length 17 [2021-08-25 20:14:34,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:14:34,104 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 339 transitions. [2021-08-25 20:14:34,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-08-25 20:14:34,105 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 339 transitions. [2021-08-25 20:14:34,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-25 20:14:34,107 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:14:34,107 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:14:34,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-25 20:14:34,108 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:14:34,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:14:34,109 INFO L82 PathProgramCache]: Analyzing trace with hash -869523856, now seen corresponding path program 1 times [2021-08-25 20:14:34,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:14:34,109 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346184210] [2021-08-25 20:14:34,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:14:34,109 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:14:34,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:14:34,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:14:34,148 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:14:34,148 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346184210] [2021-08-25 20:14:34,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346184210] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:14:34,154 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:14:34,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:14:34,155 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855861253] [2021-08-25 20:14:34,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:14:34,155 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:14:34,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:14:34,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:34,156 INFO L87 Difference]: Start difference. First operand 205 states and 339 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-08-25 20:14:34,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:14:34,177 INFO L93 Difference]: Finished difference Result 257 states and 429 transitions. [2021-08-25 20:14:34,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:14:34,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2021-08-25 20:14:34,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:14:34,180 INFO L225 Difference]: With dead ends: 257 [2021-08-25 20:14:34,180 INFO L226 Difference]: Without dead ends: 255 [2021-08-25 20:14:34,181 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:34,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2021-08-25 20:14:34,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 205. [2021-08-25 20:14:34,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.642156862745098) internal successors, (335), 204 states have internal predecessors, (335), 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-08-25 20:14:34,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 335 transitions. [2021-08-25 20:14:34,200 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 335 transitions. Word has length 17 [2021-08-25 20:14:34,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:14:34,200 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 335 transitions. [2021-08-25 20:14:34,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-08-25 20:14:34,201 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 335 transitions. [2021-08-25 20:14:34,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-25 20:14:34,205 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:14:34,206 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:14:34,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-25 20:14:34,207 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:14:34,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:14:34,208 INFO L82 PathProgramCache]: Analyzing trace with hash -927055644, now seen corresponding path program 1 times [2021-08-25 20:14:34,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:14:34,208 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450426692] [2021-08-25 20:14:34,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:14:34,208 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:14:34,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:14:34,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:14:34,238 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:14:34,238 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450426692] [2021-08-25 20:14:34,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450426692] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:14:34,238 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:14:34,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:14:34,239 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492343963] [2021-08-25 20:14:34,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:14:34,239 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:14:34,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:14:34,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:34,240 INFO L87 Difference]: Start difference. First operand 205 states and 335 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-08-25 20:14:34,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:14:34,256 INFO L93 Difference]: Finished difference Result 373 states and 617 transitions. [2021-08-25 20:14:34,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:14:34,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2021-08-25 20:14:34,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:14:34,258 INFO L225 Difference]: With dead ends: 373 [2021-08-25 20:14:34,258 INFO L226 Difference]: Without dead ends: 371 [2021-08-25 20:14:34,259 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:34,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2021-08-25 20:14:34,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 289. [2021-08-25 20:14:34,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 288 states have (on average 1.6076388888888888) internal successors, (463), 288 states have internal predecessors, (463), 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-08-25 20:14:34,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 463 transitions. [2021-08-25 20:14:34,271 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 463 transitions. Word has length 18 [2021-08-25 20:14:34,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:14:34,272 INFO L470 AbstractCegarLoop]: Abstraction has 289 states and 463 transitions. [2021-08-25 20:14:34,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-08-25 20:14:34,272 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 463 transitions. [2021-08-25 20:14:34,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-25 20:14:34,273 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:14:34,273 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:14:34,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-25 20:14:34,274 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:14:34,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:14:34,274 INFO L82 PathProgramCache]: Analyzing trace with hash -225991066, now seen corresponding path program 1 times [2021-08-25 20:14:34,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:14:34,275 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726570112] [2021-08-25 20:14:34,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:14:34,275 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:14:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:14:34,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:14:34,298 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:14:34,298 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726570112] [2021-08-25 20:14:34,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726570112] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:14:34,298 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:14:34,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:14:34,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431798211] [2021-08-25 20:14:34,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:14:34,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:14:34,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:14:34,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:34,300 INFO L87 Difference]: Start difference. First operand 289 states and 463 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-08-25 20:14:34,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:14:34,317 INFO L93 Difference]: Finished difference Result 677 states and 1089 transitions. [2021-08-25 20:14:34,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:14:34,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2021-08-25 20:14:34,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:14:34,319 INFO L225 Difference]: With dead ends: 677 [2021-08-25 20:14:34,320 INFO L226 Difference]: Without dead ends: 395 [2021-08-25 20:14:34,321 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:34,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2021-08-25 20:14:34,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 393. [2021-08-25 20:14:34,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 392 states have (on average 1.5790816326530612) internal successors, (619), 392 states have internal predecessors, (619), 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-08-25 20:14:34,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 619 transitions. [2021-08-25 20:14:34,332 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 619 transitions. Word has length 18 [2021-08-25 20:14:34,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:14:34,333 INFO L470 AbstractCegarLoop]: Abstraction has 393 states and 619 transitions. [2021-08-25 20:14:34,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-08-25 20:14:34,333 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 619 transitions. [2021-08-25 20:14:34,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-25 20:14:34,334 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:14:34,334 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:14:34,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-25 20:14:34,334 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:14:34,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:14:34,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1326261127, now seen corresponding path program 1 times [2021-08-25 20:14:34,334 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:14:34,335 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596296031] [2021-08-25 20:14:34,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:14:34,335 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:14:34,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:14:34,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:14:34,376 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:14:34,376 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596296031] [2021-08-25 20:14:34,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596296031] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:14:34,376 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:14:34,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:14:34,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018941763] [2021-08-25 20:14:34,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:14:34,377 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:14:34,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:14:34,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:34,379 INFO L87 Difference]: Start difference. First operand 393 states and 619 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-08-25 20:14:34,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:14:34,402 INFO L93 Difference]: Finished difference Result 597 states and 937 transitions. [2021-08-25 20:14:34,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:14:34,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-08-25 20:14:34,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:14:34,404 INFO L225 Difference]: With dead ends: 597 [2021-08-25 20:14:34,404 INFO L226 Difference]: Without dead ends: 407 [2021-08-25 20:14:34,405 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:34,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2021-08-25 20:14:34,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 405. [2021-08-25 20:14:34,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 404 states have (on average 1.551980198019802) internal successors, (627), 404 states have internal predecessors, (627), 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-08-25 20:14:34,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 627 transitions. [2021-08-25 20:14:34,421 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 627 transitions. Word has length 19 [2021-08-25 20:14:34,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:14:34,421 INFO L470 AbstractCegarLoop]: Abstraction has 405 states and 627 transitions. [2021-08-25 20:14:34,421 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-08-25 20:14:34,422 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 627 transitions. [2021-08-25 20:14:34,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-25 20:14:34,422 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:14:34,422 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:14:34,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-25 20:14:34,423 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:14:34,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:14:34,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1584426565, now seen corresponding path program 1 times [2021-08-25 20:14:34,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:14:34,424 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410526344] [2021-08-25 20:14:34,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:14:34,424 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:14:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:14:34,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:14:34,465 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:14:34,465 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410526344] [2021-08-25 20:14:34,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410526344] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:14:34,467 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:14:34,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:14:34,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039461790] [2021-08-25 20:14:34,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:14:34,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:14:34,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:14:34,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:34,471 INFO L87 Difference]: Start difference. First operand 405 states and 627 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-08-25 20:14:34,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:14:34,515 INFO L93 Difference]: Finished difference Result 713 states and 1117 transitions. [2021-08-25 20:14:34,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:14:34,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-08-25 20:14:34,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:14:34,518 INFO L225 Difference]: With dead ends: 713 [2021-08-25 20:14:34,519 INFO L226 Difference]: Without dead ends: 711 [2021-08-25 20:14:34,519 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:34,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2021-08-25 20:14:34,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 581. [2021-08-25 20:14:34,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 580 states have (on average 1.5086206896551724) internal successors, (875), 580 states have internal predecessors, (875), 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-08-25 20:14:34,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 875 transitions. [2021-08-25 20:14:34,545 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 875 transitions. Word has length 19 [2021-08-25 20:14:34,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:14:34,547 INFO L470 AbstractCegarLoop]: Abstraction has 581 states and 875 transitions. [2021-08-25 20:14:34,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-08-25 20:14:34,548 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 875 transitions. [2021-08-25 20:14:34,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-25 20:14:34,555 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:14:34,555 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:14:34,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-25 20:14:34,556 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:14:34,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:14:34,557 INFO L82 PathProgramCache]: Analyzing trace with hash -2009476153, now seen corresponding path program 1 times [2021-08-25 20:14:34,557 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:14:34,558 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812358435] [2021-08-25 20:14:34,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:14:34,558 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:14:34,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:14:34,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:14:34,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:14:34,593 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812358435] [2021-08-25 20:14:34,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812358435] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:14:34,593 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:14:34,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:14:34,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257391167] [2021-08-25 20:14:34,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:14:34,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:14:34,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:14:34,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:34,595 INFO L87 Difference]: Start difference. First operand 581 states and 875 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-08-25 20:14:34,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:14:34,614 INFO L93 Difference]: Finished difference Result 1337 states and 2013 transitions. [2021-08-25 20:14:34,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:14:34,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-08-25 20:14:34,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:14:34,618 INFO L225 Difference]: With dead ends: 1337 [2021-08-25 20:14:34,618 INFO L226 Difference]: Without dead ends: 775 [2021-08-25 20:14:34,619 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:34,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2021-08-25 20:14:34,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 773. [2021-08-25 20:14:34,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 772 states have (on average 1.4753886010362693) internal successors, (1139), 772 states have internal predecessors, (1139), 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-08-25 20:14:34,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1139 transitions. [2021-08-25 20:14:34,638 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1139 transitions. Word has length 19 [2021-08-25 20:14:34,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:14:34,638 INFO L470 AbstractCegarLoop]: Abstraction has 773 states and 1139 transitions. [2021-08-25 20:14:34,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-08-25 20:14:34,638 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1139 transitions. [2021-08-25 20:14:34,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-25 20:14:34,640 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:14:34,640 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:14:34,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-25 20:14:34,640 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:14:34,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:14:34,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1872798619, now seen corresponding path program 1 times [2021-08-25 20:14:34,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:14:34,641 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429049333] [2021-08-25 20:14:34,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:14:34,641 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:14:34,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:14:34,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:14:34,660 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:14:34,660 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429049333] [2021-08-25 20:14:34,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429049333] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:14:34,661 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:14:34,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:14:34,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406912608] [2021-08-25 20:14:34,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:14:34,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:14:34,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:14:34,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:34,662 INFO L87 Difference]: Start difference. First operand 773 states and 1139 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-08-25 20:14:34,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:14:34,679 INFO L93 Difference]: Finished difference Result 1161 states and 1701 transitions. [2021-08-25 20:14:34,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:14:34,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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) Word has length 20 [2021-08-25 20:14:34,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:14:34,683 INFO L225 Difference]: With dead ends: 1161 [2021-08-25 20:14:34,683 INFO L226 Difference]: Without dead ends: 791 [2021-08-25 20:14:34,684 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:34,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2021-08-25 20:14:34,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 789. [2021-08-25 20:14:34,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.4454314720812182) internal successors, (1139), 788 states have internal predecessors, (1139), 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-08-25 20:14:34,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1139 transitions. [2021-08-25 20:14:34,702 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1139 transitions. Word has length 20 [2021-08-25 20:14:34,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:14:34,703 INFO L470 AbstractCegarLoop]: Abstraction has 789 states and 1139 transitions. [2021-08-25 20:14:34,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-08-25 20:14:34,703 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1139 transitions. [2021-08-25 20:14:34,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-25 20:14:34,705 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:14:34,705 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:14:34,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-25 20:14:34,705 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:14:34,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:14:34,706 INFO L82 PathProgramCache]: Analyzing trace with hash 2130964057, now seen corresponding path program 1 times [2021-08-25 20:14:34,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:14:34,706 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676514650] [2021-08-25 20:14:34,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:14:34,706 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:14:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:14:34,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:14:34,725 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:14:34,725 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676514650] [2021-08-25 20:14:34,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676514650] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:14:34,726 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:14:34,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:14:34,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874087889] [2021-08-25 20:14:34,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:14:34,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:14:34,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:14:34,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:34,727 INFO L87 Difference]: Start difference. First operand 789 states and 1139 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-08-25 20:14:34,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:14:34,758 INFO L93 Difference]: Finished difference Result 1353 states and 1973 transitions. [2021-08-25 20:14:34,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:14:34,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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) Word has length 20 [2021-08-25 20:14:34,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:14:34,763 INFO L225 Difference]: With dead ends: 1353 [2021-08-25 20:14:34,763 INFO L226 Difference]: Without dead ends: 1351 [2021-08-25 20:14:34,764 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:34,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2021-08-25 20:14:34,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1157. [2021-08-25 20:14:34,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1156 states have (on average 1.4005190311418685) internal successors, (1619), 1156 states have internal predecessors, (1619), 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-08-25 20:14:34,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1619 transitions. [2021-08-25 20:14:34,790 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1619 transitions. Word has length 20 [2021-08-25 20:14:34,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:14:34,791 INFO L470 AbstractCegarLoop]: Abstraction has 1157 states and 1619 transitions. [2021-08-25 20:14:34,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-08-25 20:14:34,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1619 transitions. [2021-08-25 20:14:34,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-25 20:14:34,793 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:14:34,793 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:14:34,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-25 20:14:34,794 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:14:34,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:14:34,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1462938661, now seen corresponding path program 1 times [2021-08-25 20:14:34,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:14:34,795 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744568913] [2021-08-25 20:14:34,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:14:34,795 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:14:34,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:14:34,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:14:34,813 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:14:34,813 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744568913] [2021-08-25 20:14:34,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744568913] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:14:34,814 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:14:34,814 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:14:34,814 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225844697] [2021-08-25 20:14:34,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:14:34,814 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:14:34,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:14:34,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:34,815 INFO L87 Difference]: Start difference. First operand 1157 states and 1619 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-08-25 20:14:34,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:14:34,844 INFO L93 Difference]: Finished difference Result 2633 states and 3669 transitions. [2021-08-25 20:14:34,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:14:34,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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) Word has length 20 [2021-08-25 20:14:34,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:14:34,850 INFO L225 Difference]: With dead ends: 2633 [2021-08-25 20:14:34,850 INFO L226 Difference]: Without dead ends: 1511 [2021-08-25 20:14:34,852 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:34,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2021-08-25 20:14:34,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1509. [2021-08-25 20:14:34,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1508 states have (on average 1.360079575596817) internal successors, (2051), 1508 states have internal predecessors, (2051), 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-08-25 20:14:34,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 2051 transitions. [2021-08-25 20:14:34,890 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 2051 transitions. Word has length 20 [2021-08-25 20:14:34,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:14:34,890 INFO L470 AbstractCegarLoop]: Abstraction has 1509 states and 2051 transitions. [2021-08-25 20:14:34,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-08-25 20:14:34,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 2051 transitions. [2021-08-25 20:14:34,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-25 20:14:34,892 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:14:34,892 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:14:34,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-25 20:14:34,893 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:14:34,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:14:34,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1635592028, now seen corresponding path program 1 times [2021-08-25 20:14:34,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:14:34,894 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892161738] [2021-08-25 20:14:34,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:14:34,894 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:14:34,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:14:34,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:14:34,912 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:14:34,912 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892161738] [2021-08-25 20:14:34,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892161738] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:14:34,913 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:14:34,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:14:34,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999640487] [2021-08-25 20:14:34,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:14:34,913 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:14:34,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:14:34,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:34,914 INFO L87 Difference]: Start difference. First operand 1509 states and 2051 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-08-25 20:14:34,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:14:34,948 INFO L93 Difference]: Finished difference Result 2265 states and 3061 transitions. [2021-08-25 20:14:34,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:14:34,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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) Word has length 21 [2021-08-25 20:14:34,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:14:34,953 INFO L225 Difference]: With dead ends: 2265 [2021-08-25 20:14:34,953 INFO L226 Difference]: Without dead ends: 1543 [2021-08-25 20:14:34,955 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:34,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2021-08-25 20:14:34,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1541. [2021-08-25 20:14:34,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1541 states, 1540 states have (on average 1.3318181818181818) internal successors, (2051), 1540 states have internal predecessors, (2051), 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-08-25 20:14:34,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1541 states and 2051 transitions. [2021-08-25 20:14:34,990 INFO L78 Accepts]: Start accepts. Automaton has 1541 states and 2051 transitions. Word has length 21 [2021-08-25 20:14:34,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:14:34,991 INFO L470 AbstractCegarLoop]: Abstraction has 1541 states and 2051 transitions. [2021-08-25 20:14:34,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-08-25 20:14:34,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 2051 transitions. [2021-08-25 20:14:34,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-25 20:14:34,993 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:14:34,993 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:14:34,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-25 20:14:34,993 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:14:34,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:14:34,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1893757466, now seen corresponding path program 1 times [2021-08-25 20:14:34,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:14:34,994 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153801397] [2021-08-25 20:14:34,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:14:34,994 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:14:34,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:14:35,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:14:35,011 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:14:35,011 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153801397] [2021-08-25 20:14:35,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153801397] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:14:35,012 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:14:35,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:14:35,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899278803] [2021-08-25 20:14:35,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:14:35,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:14:35,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:14:35,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:35,013 INFO L87 Difference]: Start difference. First operand 1541 states and 2051 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-08-25 20:14:35,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:14:35,049 INFO L93 Difference]: Finished difference Result 2569 states and 3429 transitions. [2021-08-25 20:14:35,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:14:35,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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) Word has length 21 [2021-08-25 20:14:35,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:14:35,058 INFO L225 Difference]: With dead ends: 2569 [2021-08-25 20:14:35,058 INFO L226 Difference]: Without dead ends: 2567 [2021-08-25 20:14:35,060 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:35,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2567 states. [2021-08-25 20:14:35,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2567 to 2309. [2021-08-25 20:14:35,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2309 states, 2308 states have (on average 1.290727902946274) internal successors, (2979), 2308 states have internal predecessors, (2979), 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-08-25 20:14:35,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2309 states to 2309 states and 2979 transitions. [2021-08-25 20:14:35,119 INFO L78 Accepts]: Start accepts. Automaton has 2309 states and 2979 transitions. Word has length 21 [2021-08-25 20:14:35,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:14:35,119 INFO L470 AbstractCegarLoop]: Abstraction has 2309 states and 2979 transitions. [2021-08-25 20:14:35,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-08-25 20:14:35,119 INFO L276 IsEmpty]: Start isEmpty. Operand 2309 states and 2979 transitions. [2021-08-25 20:14:35,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-25 20:14:35,123 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:14:35,123 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:14:35,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-25 20:14:35,123 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:14:35,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:14:35,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1700145252, now seen corresponding path program 1 times [2021-08-25 20:14:35,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:14:35,124 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725571401] [2021-08-25 20:14:35,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:14:35,124 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:14:35,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:14:35,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:14:35,142 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:14:35,142 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725571401] [2021-08-25 20:14:35,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725571401] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:14:35,143 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:14:35,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:14:35,143 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780741201] [2021-08-25 20:14:35,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:14:35,144 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:14:35,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:14:35,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:35,144 INFO L87 Difference]: Start difference. First operand 2309 states and 2979 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-08-25 20:14:35,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:14:35,189 INFO L93 Difference]: Finished difference Result 5193 states and 6629 transitions. [2021-08-25 20:14:35,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:14:35,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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) Word has length 21 [2021-08-25 20:14:35,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:14:35,198 INFO L225 Difference]: With dead ends: 5193 [2021-08-25 20:14:35,198 INFO L226 Difference]: Without dead ends: 2951 [2021-08-25 20:14:35,201 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:35,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2021-08-25 20:14:35,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2949. [2021-08-25 20:14:35,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2949 states, 2948 states have (on average 1.2384667571234735) internal successors, (3651), 2948 states have internal predecessors, (3651), 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-08-25 20:14:35,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2949 states and 3651 transitions. [2021-08-25 20:14:35,290 INFO L78 Accepts]: Start accepts. Automaton has 2949 states and 3651 transitions. Word has length 21 [2021-08-25 20:14:35,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:14:35,290 INFO L470 AbstractCegarLoop]: Abstraction has 2949 states and 3651 transitions. [2021-08-25 20:14:35,290 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-08-25 20:14:35,290 INFO L276 IsEmpty]: Start isEmpty. Operand 2949 states and 3651 transitions. [2021-08-25 20:14:35,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-25 20:14:35,294 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:14:35,294 INFO L512 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] [2021-08-25 20:14:35,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-25 20:14:35,295 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:14:35,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:14:35,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1422844656, now seen corresponding path program 1 times [2021-08-25 20:14:35,295 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:14:35,296 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794890036] [2021-08-25 20:14:35,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:14:35,296 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:14:35,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:14:35,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:14:35,313 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:14:35,313 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794890036] [2021-08-25 20:14:35,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794890036] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:14:35,313 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:14:35,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:14:35,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849041027] [2021-08-25 20:14:35,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:14:35,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:14:35,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:14:35,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:35,315 INFO L87 Difference]: Start difference. First operand 2949 states and 3651 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-08-25 20:14:35,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:14:35,359 INFO L93 Difference]: Finished difference Result 4425 states and 5445 transitions. [2021-08-25 20:14:35,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:14:35,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2021-08-25 20:14:35,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:14:35,369 INFO L225 Difference]: With dead ends: 4425 [2021-08-25 20:14:35,369 INFO L226 Difference]: Without dead ends: 3015 [2021-08-25 20:14:35,372 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:35,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3015 states. [2021-08-25 20:14:35,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3015 to 3013. [2021-08-25 20:14:35,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3013 states, 3012 states have (on average 1.2121513944223108) internal successors, (3651), 3012 states have internal predecessors, (3651), 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-08-25 20:14:35,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3013 states to 3013 states and 3651 transitions. [2021-08-25 20:14:35,472 INFO L78 Accepts]: Start accepts. Automaton has 3013 states and 3651 transitions. Word has length 22 [2021-08-25 20:14:35,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:14:35,472 INFO L470 AbstractCegarLoop]: Abstraction has 3013 states and 3651 transitions. [2021-08-25 20:14:35,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-08-25 20:14:35,472 INFO L276 IsEmpty]: Start isEmpty. Operand 3013 states and 3651 transitions. [2021-08-25 20:14:35,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-25 20:14:35,476 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:14:35,476 INFO L512 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] [2021-08-25 20:14:35,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-25 20:14:35,477 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:14:35,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:14:35,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1164679218, now seen corresponding path program 1 times [2021-08-25 20:14:35,477 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:14:35,478 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587231672] [2021-08-25 20:14:35,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:14:35,478 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:14:35,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:14:35,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:14:35,494 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:14:35,495 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587231672] [2021-08-25 20:14:35,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587231672] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:14:35,495 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:14:35,495 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:14:35,495 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751842087] [2021-08-25 20:14:35,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:14:35,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:14:35,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:14:35,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:35,496 INFO L87 Difference]: Start difference. First operand 3013 states and 3651 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-08-25 20:14:35,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:14:35,557 INFO L93 Difference]: Finished difference Result 4871 states and 5828 transitions. [2021-08-25 20:14:35,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:14:35,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2021-08-25 20:14:35,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:14:35,573 INFO L225 Difference]: With dead ends: 4871 [2021-08-25 20:14:35,573 INFO L226 Difference]: Without dead ends: 4869 [2021-08-25 20:14:35,575 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:35,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4869 states. [2021-08-25 20:14:35,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4869 to 4613. [2021-08-25 20:14:35,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4613 states, 4612 states have (on average 1.180182133564614) internal successors, (5443), 4612 states have internal predecessors, (5443), 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-08-25 20:14:35,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4613 states to 4613 states and 5443 transitions. [2021-08-25 20:14:35,698 INFO L78 Accepts]: Start accepts. Automaton has 4613 states and 5443 transitions. Word has length 22 [2021-08-25 20:14:35,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:14:35,698 INFO L470 AbstractCegarLoop]: Abstraction has 4613 states and 5443 transitions. [2021-08-25 20:14:35,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-08-25 20:14:35,699 INFO L276 IsEmpty]: Start isEmpty. Operand 4613 states and 5443 transitions. [2021-08-25 20:14:35,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-25 20:14:35,706 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:14:35,706 INFO L512 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] [2021-08-25 20:14:35,706 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-25 20:14:35,706 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:14:35,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:14:35,708 INFO L82 PathProgramCache]: Analyzing trace with hash -463614640, now seen corresponding path program 1 times [2021-08-25 20:14:35,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:14:35,708 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154389927] [2021-08-25 20:14:35,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:14:35,709 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:14:35,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:14:35,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:14:35,737 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:14:35,737 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154389927] [2021-08-25 20:14:35,737 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154389927] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:14:35,737 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:14:35,737 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:14:35,737 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272780038] [2021-08-25 20:14:35,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:14:35,738 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:14:35,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:14:35,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:35,739 INFO L87 Difference]: Start difference. First operand 4613 states and 5443 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-08-25 20:14:35,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:14:35,868 INFO L93 Difference]: Finished difference Result 10245 states and 11843 transitions. [2021-08-25 20:14:35,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:14:35,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2021-08-25 20:14:35,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:14:35,869 INFO L225 Difference]: With dead ends: 10245 [2021-08-25 20:14:35,869 INFO L226 Difference]: Without dead ends: 0 [2021-08-25 20:14:35,877 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:35,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-25 20:14:35,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-25 20:14:35,878 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-08-25 20:14:35,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-25 20:14:35,879 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2021-08-25 20:14:35,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:14:35,879 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-25 20:14:35,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-08-25 20:14:35,879 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-25 20:14:35,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-25 20:14:35,882 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:14:35,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-25 20:14:35,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-25 20:14:35,889 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:14:35,894 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:14:35,895 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:14:35,895 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:14:35,902 INFO L857 garLoopResultBuilder]: For program point L93(line 93) no Hoare annotation was computed. [2021-08-25 20:14:35,902 INFO L857 garLoopResultBuilder]: For program point L118(line 118) no Hoare annotation was computed. [2021-08-25 20:14:35,902 INFO L857 garLoopResultBuilder]: For program point L102-1(lines 35 132) no Hoare annotation was computed. [2021-08-25 20:14:35,903 INFO L860 garLoopResultBuilder]: At program point L127-1(lines 35 132) the Hoare annotation is: true [2021-08-25 20:14:35,903 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-25 20:14:35,903 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-25 20:14:35,903 INFO L857 garLoopResultBuilder]: For program point L86-1(lines 35 132) no Hoare annotation was computed. [2021-08-25 20:14:35,903 INFO L857 garLoopResultBuilder]: For program point L78-1(lines 35 132) no Hoare annotation was computed. [2021-08-25 20:14:35,903 INFO L860 garLoopResultBuilder]: At program point L136(lines 6 137) the Hoare annotation is: true [2021-08-25 20:14:35,904 INFO L857 garLoopResultBuilder]: For program point L103(line 103) no Hoare annotation was computed. [2021-08-25 20:14:35,904 INFO L857 garLoopResultBuilder]: For program point L37(lines 37 39) no Hoare annotation was computed. [2021-08-25 20:14:35,904 INFO L857 garLoopResultBuilder]: For program point L70-1(lines 35 132) no Hoare annotation was computed. [2021-08-25 20:14:35,904 INFO L857 garLoopResultBuilder]: For program point L128(line 128) no Hoare annotation was computed. [2021-08-25 20:14:35,904 INFO L853 garLoopResultBuilder]: At program point L128-1(lines 7 137) the Hoare annotation is: false [2021-08-25 20:14:35,905 INFO L857 garLoopResultBuilder]: For program point L62-1(lines 35 132) no Hoare annotation was computed. [2021-08-25 20:14:35,905 INFO L857 garLoopResultBuilder]: For program point L112-1(lines 35 132) no Hoare annotation was computed. [2021-08-25 20:14:35,905 INFO L857 garLoopResultBuilder]: For program point L113(line 113) no Hoare annotation was computed. [2021-08-25 20:14:35,905 INFO L857 garLoopResultBuilder]: For program point L97-1(lines 35 132) no Hoare annotation was computed. [2021-08-25 20:14:35,906 INFO L857 garLoopResultBuilder]: For program point L122-1(lines 35 132) no Hoare annotation was computed. [2021-08-25 20:14:35,906 INFO L857 garLoopResultBuilder]: For program point L98(line 98) no Hoare annotation was computed. [2021-08-25 20:14:35,906 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-08-25 20:14:35,906 INFO L857 garLoopResultBuilder]: For program point L123(line 123) no Hoare annotation was computed. [2021-08-25 20:14:35,906 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 135) no Hoare annotation was computed. [2021-08-25 20:14:35,906 INFO L857 garLoopResultBuilder]: For program point L82-1(lines 35 132) no Hoare annotation was computed. [2021-08-25 20:14:35,907 INFO L857 garLoopResultBuilder]: For program point L107-1(lines 35 132) no Hoare annotation was computed. [2021-08-25 20:14:35,907 INFO L857 garLoopResultBuilder]: For program point L74-1(lines 35 132) no Hoare annotation was computed. [2021-08-25 20:14:35,907 INFO L857 garLoopResultBuilder]: For program point L66-1(lines 35 132) no Hoare annotation was computed. [2021-08-25 20:14:35,907 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-25 20:14:35,907 INFO L857 garLoopResultBuilder]: For program point L58(lines 58 60) no Hoare annotation was computed. [2021-08-25 20:14:35,907 INFO L857 garLoopResultBuilder]: For program point L58-2(lines 35 132) no Hoare annotation was computed. [2021-08-25 20:14:35,907 INFO L857 garLoopResultBuilder]: For program point L108(line 108) no Hoare annotation was computed. [2021-08-25 20:14:35,908 INFO L860 garLoopResultBuilder]: At program point L133(lines 7 137) the Hoare annotation is: true [2021-08-25 20:14:35,908 INFO L857 garLoopResultBuilder]: For program point L92-1(lines 35 132) no Hoare annotation was computed. [2021-08-25 20:14:35,908 INFO L857 garLoopResultBuilder]: For program point L117-1(lines 35 132) no Hoare annotation was computed. [2021-08-25 20:14:35,912 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-25 20:14:35,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 08:14:35 BoogieIcfgContainer [2021-08-25 20:14:35,920 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-25 20:14:35,920 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-25 20:14:35,920 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-25 20:14:35,921 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-25 20:14:35,921 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:14:32" (3/4) ... [2021-08-25 20:14:35,924 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-25 20:14:35,934 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-08-25 20:14:35,935 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-08-25 20:14:35,935 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-25 20:14:35,935 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-25 20:14:35,968 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-25 20:14:35,968 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-25 20:14:35,970 INFO L168 Benchmark]: Toolchain (without parser) took 3799.71 ms. Allocated memory was 56.6 MB in the beginning and 205.5 MB in the end (delta: 148.9 MB). Free memory was 33.8 MB in the beginning and 144.0 MB in the end (delta: -110.2 MB). Peak memory consumption was 37.3 MB. Max. memory is 16.1 GB. [2021-08-25 20:14:35,971 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 56.6 MB. Free memory was 38.4 MB in the beginning and 38.4 MB in the end (delta: 38.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:14:35,971 INFO L168 Benchmark]: CACSL2BoogieTranslator took 291.85 ms. Allocated memory was 56.6 MB in the beginning and 79.7 MB in the end (delta: 23.1 MB). Free memory was 33.6 MB in the beginning and 63.3 MB in the end (delta: -29.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-08-25 20:14:35,971 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.27 ms. Allocated memory is still 79.7 MB. Free memory was 63.3 MB in the beginning and 61.5 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:14:35,971 INFO L168 Benchmark]: Boogie Preprocessor took 37.31 ms. Allocated memory is still 79.7 MB. Free memory was 61.5 MB in the beginning and 60.4 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:14:35,972 INFO L168 Benchmark]: RCFGBuilder took 432.88 ms. Allocated memory is still 79.7 MB. Free memory was 60.4 MB in the beginning and 42.4 MB in the end (delta: 18.1 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-08-25 20:14:35,972 INFO L168 Benchmark]: TraceAbstraction took 2936.74 ms. Allocated memory was 79.7 MB in the beginning and 205.5 MB in the end (delta: 125.8 MB). Free memory was 41.8 MB in the beginning and 148.2 MB in the end (delta: -106.4 MB). Peak memory consumption was 21.2 MB. Max. memory is 16.1 GB. [2021-08-25 20:14:35,972 INFO L168 Benchmark]: Witness Printer took 48.21 ms. Allocated memory is still 205.5 MB. Free memory was 148.2 MB in the beginning and 144.0 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-25 20:14:35,974 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.20 ms. Allocated memory is still 56.6 MB. Free memory was 38.4 MB in the beginning and 38.4 MB in the end (delta: 38.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 291.85 ms. Allocated memory was 56.6 MB in the beginning and 79.7 MB in the end (delta: 23.1 MB). Free memory was 33.6 MB in the beginning and 63.3 MB in the end (delta: -29.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 44.27 ms. Allocated memory is still 79.7 MB. Free memory was 63.3 MB in the beginning and 61.5 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 37.31 ms. Allocated memory is still 79.7 MB. Free memory was 61.5 MB in the beginning and 60.4 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 432.88 ms. Allocated memory is still 79.7 MB. Free memory was 60.4 MB in the beginning and 42.4 MB in the end (delta: 18.1 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 2936.74 ms. Allocated memory was 79.7 MB in the beginning and 205.5 MB in the end (delta: 125.8 MB). Free memory was 41.8 MB in the beginning and 148.2 MB in the end (delta: -106.4 MB). Peak memory consumption was 21.2 MB. Max. memory is 16.1 GB. * Witness Printer took 48.21 ms. Allocated memory is still 205.5 MB. Free memory was 148.2 MB in the beginning and 144.0 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 - PositiveResult [Line: 135]: 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 CFG has 1 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2883.9ms, OverallIterations: 22, TraceHistogramMax: 1, EmptinessCheckTime: 66.1ms, AutomataDifference: 923.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 19.0ms, InitialAbstractionConstructionTime: 10.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1474 SDtfs, 720 SDslu, 964 SDs, 0 SdLazy, 117 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 164.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 63.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=4613occurred in iteration=21, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 694.3ms AutomataMinimizationTime, 22 MinimizatonAttempts, 1044 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 265 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 8.6ms HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 2.8ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 39.4ms SsaConstructionTime, 228.5ms SatisfiabilityAnalysisTime, 546.0ms InterpolantComputationTime, 411 NumberOfCodeBlocks, 411 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 389 ConstructedInterpolants, 0 QuantifiedInterpolants, 805 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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 1 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-08-25 20:14:36,010 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...