./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-14.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-14.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '3cc62b0a7b5ca086e8c61d00992860cd8ca304621a0a6299cced66b64f38849b'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-14.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 3cc62b0a7b5ca086e8c61d00992860cd8ca304621a0a6299cced66b64f38849b --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:17:43,396 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:17:43,505 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 08:17:43,512 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:17:43,512 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:17:43,542 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:17:43,544 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:17:43,544 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:17:43,544 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:17:43,545 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:17:43,545 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:17:43,546 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:17:43,546 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:17:43,546 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:17:43,546 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:17:43,547 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:17:43,547 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:17:43,547 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:17:43,547 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 08:17:43,547 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:17:43,548 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:17:43,548 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:17:43,548 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:17:43,548 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:17:43,548 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:17:43,548 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:17:43,548 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:17:43,549 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:17:43,549 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:17:43,549 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:17:43,549 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:17:43,549 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:17:43,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:17:43,550 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:17:43,550 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:17:43,550 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:17:43,551 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 08:17:43,551 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 08:17:43,551 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:17:43,551 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:17:43,551 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:17:43,551 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:17:43,551 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 3cc62b0a7b5ca086e8c61d00992860cd8ca304621a0a6299cced66b64f38849b [2024-11-07 08:17:43,857 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:17:43,867 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:17:43,869 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:17:43,870 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:17:43,870 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:17:43,871 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-14.i [2024-11-07 08:17:45,162 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:17:45,414 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:17:45,415 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-14.i [2024-11-07 08:17:45,421 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f822fd06b/6611e25e533542ec87fd34cc81eb8a5b/FLAG1f86be0d5 [2024-11-07 08:17:45,441 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f822fd06b/6611e25e533542ec87fd34cc81eb8a5b [2024-11-07 08:17:45,443 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:17:45,445 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:17:45,447 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:17:45,447 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:17:45,451 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:17:45,451 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:17:45" (1/1) ... [2024-11-07 08:17:45,454 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@259767ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:45, skipping insertion in model container [2024-11-07 08:17:45,454 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:17:45" (1/1) ... [2024-11-07 08:17:45,471 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:17:45,605 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-14.i[915,928] [2024-11-07 08:17:45,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:17:45,663 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:17:45,672 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-14.i[915,928] [2024-11-07 08:17:45,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:17:45,708 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:17:45,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:45 WrapperNode [2024-11-07 08:17:45,709 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:17:45,710 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:17:45,711 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:17:45,711 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:17:45,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:45" (1/1) ... [2024-11-07 08:17:45,725 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:45" (1/1) ... [2024-11-07 08:17:45,752 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2024-11-07 08:17:45,753 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:17:45,753 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:17:45,753 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:17:45,754 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:17:45,760 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:45" (1/1) ... [2024-11-07 08:17:45,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:45" (1/1) ... [2024-11-07 08:17:45,762 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:45" (1/1) ... [2024-11-07 08:17:45,782 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 08:17:45,782 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:45" (1/1) ... [2024-11-07 08:17:45,782 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:45" (1/1) ... [2024-11-07 08:17:45,786 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:45" (1/1) ... [2024-11-07 08:17:45,789 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:45" (1/1) ... [2024-11-07 08:17:45,791 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:45" (1/1) ... [2024-11-07 08:17:45,791 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:45" (1/1) ... [2024-11-07 08:17:45,793 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:17:45,794 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:17:45,794 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:17:45,794 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:17:45,795 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:45" (1/1) ... [2024-11-07 08:17:45,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:17:45,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:17:45,824 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 08:17:45,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 08:17:45,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:17:45,846 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:17:45,846 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:17:45,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 08:17:45,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:17:45,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:17:45,908 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:17:45,909 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:17:46,096 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-07 08:17:46,096 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:17:46,111 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:17:46,113 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:17:46,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:17:46 BoogieIcfgContainer [2024-11-07 08:17:46,114 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:17:46,116 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:17:46,116 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:17:46,121 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:17:46,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:17:45" (1/3) ... [2024-11-07 08:17:46,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d7a3657 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:17:46, skipping insertion in model container [2024-11-07 08:17:46,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:45" (2/3) ... [2024-11-07 08:17:46,123 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d7a3657 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:17:46, skipping insertion in model container [2024-11-07 08:17:46,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:17:46" (3/3) ... [2024-11-07 08:17:46,124 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-14.i [2024-11-07 08:17:46,138 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:17:46,138 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:17:46,195 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:17:46,205 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4bde416f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:17:46,205 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:17:46,210 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 08:17:46,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 08:17:46,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:17:46,220 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:17:46,221 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:17:46,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:17:46,224 INFO L85 PathProgramCache]: Analyzing trace with hash -805587759, now seen corresponding path program 1 times [2024-11-07 08:17:46,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:17:46,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705606800] [2024-11-07 08:17:46,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:17:46,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:17:46,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:46,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:17:46,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:46,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:17:46,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:46,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:17:46,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:46,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:17:46,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:46,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:17:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:46,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:17:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:46,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:17:46,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:46,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:17:46,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:46,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:17:46,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:46,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:17:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:46,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:17:46,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:46,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:17:46,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:46,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:17:46,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:46,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:17:46,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:46,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:17:46,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:46,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:17:46,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:46,492 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 08:17:46,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:17:46,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705606800] [2024-11-07 08:17:46,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705606800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:17:46,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:17:46,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:17:46,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059961725] [2024-11-07 08:17:46,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:17:46,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:17:46,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:17:46,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:17:46,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:17:46,517 INFO L87 Difference]: Start difference. First operand has 52 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 08:17:46,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:17:46,545 INFO L93 Difference]: Finished difference Result 101 states and 163 transitions. [2024-11-07 08:17:46,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:17:46,547 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 104 [2024-11-07 08:17:46,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:17:46,553 INFO L225 Difference]: With dead ends: 101 [2024-11-07 08:17:46,554 INFO L226 Difference]: Without dead ends: 48 [2024-11-07 08:17:46,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:17:46,561 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:17:46,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:17:46,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-07 08:17:46,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-07 08:17:46,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 08:17:46,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2024-11-07 08:17:46,601 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 104 [2024-11-07 08:17:46,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:17:46,601 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2024-11-07 08:17:46,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 08:17:46,602 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2024-11-07 08:17:46,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 08:17:46,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:17:46,605 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:17:46,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 08:17:46,605 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:17:46,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:17:46,606 INFO L85 PathProgramCache]: Analyzing trace with hash -438659887, now seen corresponding path program 1 times [2024-11-07 08:17:46,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:17:46,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447068266] [2024-11-07 08:17:46,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:17:46,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:17:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:47,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:17:47,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:47,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:17:47,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:47,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:17:47,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:47,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:17:47,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:47,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:17:47,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:47,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:17:47,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:47,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:17:47,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:47,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:17:47,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:47,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:17:47,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:47,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:17:47,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:47,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:17:47,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:47,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:17:47,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:47,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:17:47,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:47,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:17:47,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:47,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:17:47,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:47,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:17:47,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:47,193 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 08:17:47,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:17:47,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447068266] [2024-11-07 08:17:47,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447068266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:17:47,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:17:47,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 08:17:47,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276898316] [2024-11-07 08:17:47,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:17:47,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 08:17:47,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:17:47,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 08:17:47,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 08:17:47,199 INFO L87 Difference]: Start difference. First operand 48 states and 68 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 08:17:47,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:17:47,362 INFO L93 Difference]: Finished difference Result 150 states and 212 transitions. [2024-11-07 08:17:47,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 08:17:47,364 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 104 [2024-11-07 08:17:47,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:17:47,366 INFO L225 Difference]: With dead ends: 150 [2024-11-07 08:17:47,366 INFO L226 Difference]: Without dead ends: 105 [2024-11-07 08:17:47,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:17:47,367 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 66 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 08:17:47,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 183 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 08:17:47,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-07 08:17:47,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 91. [2024-11-07 08:17:47,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 56 states have internal predecessors, (66), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 08:17:47,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 130 transitions. [2024-11-07 08:17:47,400 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 130 transitions. Word has length 104 [2024-11-07 08:17:47,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:17:47,401 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 130 transitions. [2024-11-07 08:17:47,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 08:17:47,402 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 130 transitions. [2024-11-07 08:17:47,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 08:17:47,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:17:47,404 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:17:47,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 08:17:47,405 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:17:47,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:17:47,405 INFO L85 PathProgramCache]: Analyzing trace with hash 262404691, now seen corresponding path program 1 times [2024-11-07 08:17:47,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:17:47,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010410412] [2024-11-07 08:17:47,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:17:47,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:17:47,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:51,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:17:51,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:51,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:17:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:51,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:17:51,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:51,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:17:51,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:51,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:17:51,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:51,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:17:51,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:51,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:17:51,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:51,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:17:51,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:51,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:17:51,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:51,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:17:51,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:51,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:17:51,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:51,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:17:51,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:51,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:17:51,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:51,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:17:51,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:51,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:17:51,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:51,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:17:51,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:51,226 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 08:17:51,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:17:51,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010410412] [2024-11-07 08:17:51,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010410412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:17:51,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:17:51,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 08:17:51,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12234209] [2024-11-07 08:17:51,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:17:51,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 08:17:51,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:17:51,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 08:17:51,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-07 08:17:51,228 INFO L87 Difference]: Start difference. First operand 91 states and 130 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 08:17:52,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:17:52,257 INFO L93 Difference]: Finished difference Result 102 states and 140 transitions. [2024-11-07 08:17:52,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 08:17:52,257 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 104 [2024-11-07 08:17:52,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:17:52,260 INFO L225 Difference]: With dead ends: 102 [2024-11-07 08:17:52,260 INFO L226 Difference]: Without dead ends: 100 [2024-11-07 08:17:52,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2024-11-07 08:17:52,261 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 55 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 08:17:52,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 268 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 08:17:52,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-07 08:17:52,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 94. [2024-11-07 08:17:52,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 59 states have internal predecessors, (69), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 08:17:52,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 133 transitions. [2024-11-07 08:17:52,283 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 133 transitions. Word has length 104 [2024-11-07 08:17:52,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:17:52,284 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 133 transitions. [2024-11-07 08:17:52,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 08:17:52,284 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 133 transitions. [2024-11-07 08:17:52,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 08:17:52,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:17:52,286 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:17:52,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 08:17:52,286 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:17:52,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:17:52,287 INFO L85 PathProgramCache]: Analyzing trace with hash 264251733, now seen corresponding path program 1 times [2024-11-07 08:17:52,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:17:52,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861185766] [2024-11-07 08:17:52,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:17:52,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:17:52,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:52,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:17:52,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:52,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:17:52,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:52,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:17:52,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:52,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:17:52,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:52,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:17:52,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:52,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:17:52,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:52,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:17:52,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:52,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:17:52,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:52,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:17:52,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:52,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:17:52,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:52,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:17:52,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:52,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:17:52,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:52,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:17:52,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:52,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:17:52,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:52,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:17:52,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:52,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:17:52,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:52,438 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 08:17:52,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:17:52,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861185766] [2024-11-07 08:17:52,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861185766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:17:52,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:17:52,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 08:17:52,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435075948] [2024-11-07 08:17:52,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:17:52,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 08:17:52,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:17:52,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 08:17:52,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:17:52,440 INFO L87 Difference]: Start difference. First operand 94 states and 133 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 08:17:52,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:17:52,593 INFO L93 Difference]: Finished difference Result 227 states and 324 transitions. [2024-11-07 08:17:52,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 08:17:52,594 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 104 [2024-11-07 08:17:52,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:17:52,596 INFO L225 Difference]: With dead ends: 227 [2024-11-07 08:17:52,597 INFO L226 Difference]: Without dead ends: 136 [2024-11-07 08:17:52,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 08:17:52,599 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 49 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 08:17:52,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 215 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 08:17:52,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-07 08:17:52,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2024-11-07 08:17:52,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 82 states have (on average 1.1585365853658536) internal successors, (95), 82 states have internal predecessors, (95), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 08:17:52,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 191 transitions. [2024-11-07 08:17:52,627 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 191 transitions. Word has length 104 [2024-11-07 08:17:52,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:17:52,627 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 191 transitions. [2024-11-07 08:17:52,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 08:17:52,629 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 191 transitions. [2024-11-07 08:17:52,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-07 08:17:52,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:17:52,630 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:17:52,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 08:17:52,633 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:17:52,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:17:52,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1104770207, now seen corresponding path program 1 times [2024-11-07 08:17:52,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:17:52,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97249496] [2024-11-07 08:17:52,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:17:52,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:17:52,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:56,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:17:56,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:56,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:17:56,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:56,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:17:56,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:56,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:17:56,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:56,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:17:56,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:56,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:17:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:56,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:17:56,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:56,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:17:56,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:56,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:17:56,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:56,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:17:56,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:56,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:17:56,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:56,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:17:56,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:56,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:17:56,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:56,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:17:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:56,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:17:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:56,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:17:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:56,224 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 08:17:56,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:17:56,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97249496] [2024-11-07 08:17:56,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97249496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:17:56,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:17:56,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 08:17:56,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88244486] [2024-11-07 08:17:56,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:17:56,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 08:17:56,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:17:56,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 08:17:56,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-07 08:17:56,226 INFO L87 Difference]: Start difference. First operand 134 states and 191 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 08:17:57,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:17:57,383 INFO L93 Difference]: Finished difference Result 171 states and 229 transitions. [2024-11-07 08:17:57,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 08:17:57,383 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2024-11-07 08:17:57,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:17:57,385 INFO L225 Difference]: With dead ends: 171 [2024-11-07 08:17:57,385 INFO L226 Difference]: Without dead ends: 169 [2024-11-07 08:17:57,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-07 08:17:57,386 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 83 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 08:17:57,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 363 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 08:17:57,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-07 08:17:57,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 141. [2024-11-07 08:17:57,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 89 states have (on average 1.1573033707865168) internal successors, (103), 89 states have internal predecessors, (103), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 08:17:57,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 199 transitions. [2024-11-07 08:17:57,421 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 199 transitions. Word has length 105 [2024-11-07 08:17:57,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:17:57,424 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 199 transitions. [2024-11-07 08:17:57,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 08:17:57,425 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 199 transitions. [2024-11-07 08:17:57,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-07 08:17:57,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:17:57,426 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:17:57,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 08:17:57,426 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:17:57,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:17:57,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1415189727, now seen corresponding path program 1 times [2024-11-07 08:17:57,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:17:57,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894850410] [2024-11-07 08:17:57,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:17:57,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:17:57,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:59,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:17:59,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:59,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:17:59,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:59,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:17:59,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:59,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:17:59,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:59,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:17:59,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:59,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:17:59,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:59,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:17:59,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:59,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:18:00,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:00,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:18:00,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:00,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:18:00,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:00,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:18:00,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:00,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:18:00,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:00,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:18:00,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:00,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:18:00,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:00,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:18:00,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:00,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:18:00,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:00,011 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 08:18:00,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:18:00,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894850410] [2024-11-07 08:18:00,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894850410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:18:00,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:18:00,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 08:18:00,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352829613] [2024-11-07 08:18:00,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:18:00,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 08:18:00,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:18:00,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 08:18:00,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-07 08:18:00,013 INFO L87 Difference]: Start difference. First operand 141 states and 199 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 08:18:00,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:18:00,493 INFO L93 Difference]: Finished difference Result 167 states and 228 transitions. [2024-11-07 08:18:00,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 08:18:00,493 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2024-11-07 08:18:00,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:18:00,495 INFO L225 Difference]: With dead ends: 167 [2024-11-07 08:18:00,497 INFO L226 Difference]: Without dead ends: 165 [2024-11-07 08:18:00,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-07 08:18:00,498 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 38 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 08:18:00,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 269 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 08:18:00,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-07 08:18:00,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 148. [2024-11-07 08:18:00,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 96 states have (on average 1.1666666666666667) internal successors, (112), 96 states have internal predecessors, (112), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 08:18:00,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 208 transitions. [2024-11-07 08:18:00,527 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 208 transitions. Word has length 105 [2024-11-07 08:18:00,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:18:00,527 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 208 transitions. [2024-11-07 08:18:00,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 08:18:00,528 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 208 transitions. [2024-11-07 08:18:00,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-07 08:18:00,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:18:00,533 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:18:00,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 08:18:00,534 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:18:00,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:18:00,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1739883004, now seen corresponding path program 1 times [2024-11-07 08:18:00,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:18:00,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692760318] [2024-11-07 08:18:00,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:18:00,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:18:00,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:00,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:18:00,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:00,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:18:00,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:00,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:18:00,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:00,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:18:00,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:00,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:18:00,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:00,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:18:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:00,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:18:00,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:00,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:18:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:00,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:18:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:00,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:18:00,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:00,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:18:00,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:00,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:18:00,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:00,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:18:00,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:00,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:18:00,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:00,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:18:00,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:00,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:18:00,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:00,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 08:18:00,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:00,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 08:18:00,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:00,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 08:18:00,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:00,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-07 08:18:00,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:00,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-07 08:18:00,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:00,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-07 08:18:00,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:00,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 08:18:00,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:00,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-07 08:18:00,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:00,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 08:18:00,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:00,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-07 08:18:00,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:00,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 08:18:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:00,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-07 08:18:00,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:00,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-07 08:18:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:00,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-07 08:18:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:00,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-07 08:18:00,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:00,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-07 08:18:00,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:00,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2020 backedges. 35 proven. 1 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 08:18:00,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:18:00,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692760318] [2024-11-07 08:18:00,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692760318] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:18:00,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501740986] [2024-11-07 08:18:00,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:18:00,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:18:00,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:18:00,717 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 08:18:00,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 08:18:00,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:00,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 08:18:00,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:18:00,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2020 backedges. 1060 proven. 0 refuted. 0 times theorem prover too weak. 960 trivial. 0 not checked. [2024-11-07 08:18:00,987 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:18:00,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501740986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:18:00,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 08:18:00,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2024-11-07 08:18:00,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515744934] [2024-11-07 08:18:00,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:18:00,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 08:18:00,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:18:00,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 08:18:00,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:18:00,992 INFO L87 Difference]: Start difference. First operand 148 states and 208 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 08:18:01,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:18:01,048 INFO L93 Difference]: Finished difference Result 210 states and 289 transitions. [2024-11-07 08:18:01,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 08:18:01,049 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 207 [2024-11-07 08:18:01,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:18:01,050 INFO L225 Difference]: With dead ends: 210 [2024-11-07 08:18:01,050 INFO L226 Difference]: Without dead ends: 0 [2024-11-07 08:18:01,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:18:01,052 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 4 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:18:01,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 108 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:18:01,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-07 08:18:01,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-07 08:18:01,054 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) [2024-11-07 08:18:01,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-07 08:18:01,054 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 207 [2024-11-07 08:18:01,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:18:01,054 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 08:18:01,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 08:18:01,055 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-07 08:18:01,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-07 08:18:01,057 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 08:18:01,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 08:18:01,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:18:01,262 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:18:01,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-07 08:18:01,986 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 08:18:02,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:18:02 BoogieIcfgContainer [2024-11-07 08:18:02,011 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 08:18:02,012 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 08:18:02,012 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 08:18:02,012 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 08:18:02,013 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:17:46" (3/4) ... [2024-11-07 08:18:02,015 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 08:18:02,020 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-07 08:18:02,026 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-07 08:18:02,027 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-07 08:18:02,027 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-07 08:18:02,027 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 08:18:02,108 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 08:18:02,108 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 08:18:02,108 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 08:18:02,110 INFO L158 Benchmark]: Toolchain (without parser) took 16663.36ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 116.7MB in the beginning and 387.5MB in the end (delta: -270.8MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2024-11-07 08:18:02,111 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 117.4MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:18:02,111 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.95ms. Allocated memory is still 142.6MB. Free memory was 116.5MB in the beginning and 104.0MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:18:02,111 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.84ms. Allocated memory is still 142.6MB. Free memory was 104.0MB in the beginning and 102.3MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:18:02,111 INFO L158 Benchmark]: Boogie Preprocessor took 39.68ms. Allocated memory is still 142.6MB. Free memory was 102.2MB in the beginning and 100.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:18:02,112 INFO L158 Benchmark]: RCFGBuilder took 319.87ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 85.3MB in the end (delta: 15.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:18:02,112 INFO L158 Benchmark]: TraceAbstraction took 15895.53ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 84.8MB in the beginning and 391.8MB in the end (delta: -307.1MB). Peak memory consumption was 224.6MB. Max. memory is 16.1GB. [2024-11-07 08:18:02,112 INFO L158 Benchmark]: Witness Printer took 95.98ms. Allocated memory is still 427.8MB. Free memory was 391.8MB in the beginning and 387.5MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:18:02,114 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 117.4MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 262.95ms. Allocated memory is still 142.6MB. Free memory was 116.5MB in the beginning and 104.0MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.84ms. Allocated memory is still 142.6MB. Free memory was 104.0MB in the beginning and 102.3MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.68ms. Allocated memory is still 142.6MB. Free memory was 102.2MB in the beginning and 100.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 319.87ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 85.3MB in the end (delta: 15.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 15895.53ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 84.8MB in the beginning and 391.8MB in the end (delta: -307.1MB). Peak memory consumption was 224.6MB. Max. memory is 16.1GB. * Witness Printer took 95.98ms. Allocated memory is still 427.8MB. Free memory was 391.8MB in the beginning and 387.5MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.1s, OverallIterations: 7, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 295 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 295 mSDsluCounter, 1478 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1022 mSDsCounter, 104 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 739 IncrementalHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 104 mSolverCounterUnsat, 456 mSDtfsCounter, 739 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 540 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=148occurred in iteration=6, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 67 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 10.9s InterpolantComputationTime, 1040 NumberOfCodeBlocks, 1040 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1032 ConstructedInterpolants, 0 QuantifiedInterpolants, 4612 SizeOfPredicates, 0 NumberOfNonLiveVariables, 461 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 6919/6920 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: 105]: Loop Invariant Derived loop invariant: (((1 <= k_loop) && (((var_1_5 == last_1_var_1_12) && (last_1_var_1_9 != 0)) || ((last_1_var_1_9 == 0) && (((((((16 + var_1_7) + (var_1_8 * 65535)) >= 0) ? (((16 + var_1_7) + (var_1_8 * 65535)) % 65536) : ((((16 + var_1_7) + (var_1_8 * 65535)) % 65536) + 65536)) == var_1_5) && (((((16 + var_1_7) + (var_1_8 * 65535)) >= 0) ? (((16 + var_1_7) + (var_1_8 * 65535)) % 65536) : ((((16 + var_1_7) + (var_1_8 * 65535)) % 65536) + 65536)) <= 32767)) || (((65536 + var_1_5) == ((((16 + var_1_7) + (var_1_8 * 65535)) >= 0) ? (((16 + var_1_7) + (var_1_8 * 65535)) % 65536) : ((((16 + var_1_7) + (var_1_8 * 65535)) % 65536) + 65536))) && (32768 <= ((((16 + var_1_7) + (var_1_8 * 65535)) >= 0) ? (((16 + var_1_7) + (var_1_8 * 65535)) % 65536) : ((((16 + var_1_7) + (var_1_8 * 65535)) % 65536) + 65536)))))))) || (((((last_1_var_1_9 == 0) && (1000000 <= var_1_1)) && (0 <= k_loop)) && (var_1_9 == 0)) && (((long long) var_1_18 + 999744) <= var_1_1))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: ((((last_1_var_1_9 == 0) && (1000000 <= var_1_1)) && (var_1_9 == 0)) && (((long long) var_1_18 + 999744) <= var_1_1)) Ensures: (((((last_1_var_1_9 == 0) && (1000000 <= var_1_1)) && (var_1_9 == 0)) && (((long long) var_1_18 + 999744) <= var_1_1)) && ((((((((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_2 == \old(var_1_2))) && (var_1_5 == \old(var_1_5))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (var_1_14 == \old(var_1_14))) && (var_1_15 == \old(var_1_15))) && (var_1_16 == \old(var_1_16))) && (var_1_17 == \old(var_1_17))) && (var_1_18 == \old(var_1_18))) && (last_1_var_1_5 == \old(last_1_var_1_5))) && (last_1_var_1_9 == \old(last_1_var_1_9))) && (last_1_var_1_12 == \old(last_1_var_1_12)))) RESULT: Ultimate proved your program to be correct! [2024-11-07 08:18:02,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE