./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-44.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-44.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', 'bd18df5335c166ad57722e76e66445ba6bc9802d8c865b1ba91e68124487e889'] 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-44.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 bd18df5335c166ad57722e76e66445ba6bc9802d8c865b1ba91e68124487e889 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:20:43,626 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:20:43,726 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:20:43,733 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:20:43,734 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:20:43,759 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:20:43,760 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:20:43,760 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:20:43,761 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:20:43,761 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:20:43,762 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:20:43,762 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:20:43,762 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:20:43,762 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:20:43,763 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:20:43,763 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:20:43,763 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:20:43,763 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:20:43,763 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 08:20:43,763 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:20:43,763 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:20:43,763 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:20:43,763 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:20:43,764 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:20:43,764 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:20:43,764 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:20:43,764 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:20:43,764 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:20:43,764 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:20:43,765 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:20:43,765 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:20:43,765 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:20:43,765 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:20:43,765 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:20:43,766 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:20:43,766 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:20:43,766 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 08:20:43,766 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 08:20:43,766 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:20:43,766 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:20:43,766 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:20:43,767 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:20:43,767 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 -> bd18df5335c166ad57722e76e66445ba6bc9802d8c865b1ba91e68124487e889 [2024-11-07 08:20:44,152 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:20:44,165 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:20:44,168 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:20:44,169 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:20:44,169 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:20:44,170 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-44.i [2024-11-07 08:20:45,525 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:20:45,768 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:20:45,770 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-44.i [2024-11-07 08:20:45,779 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2fc639ff7/26d318975af44cb8822c60a2ba4c2a53/FLAG344f2bf3d [2024-11-07 08:20:45,798 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2fc639ff7/26d318975af44cb8822c60a2ba4c2a53 [2024-11-07 08:20:45,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:20:45,803 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:20:45,804 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:20:45,805 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:20:45,808 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:20:45,809 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:20:45" (1/1) ... [2024-11-07 08:20:45,811 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2976ff08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:45, skipping insertion in model container [2024-11-07 08:20:45,811 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:20:45" (1/1) ... [2024-11-07 08:20:45,826 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:20:45,953 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-44.i[915,928] [2024-11-07 08:20:46,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:20:46,023 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:20:46,031 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-44.i[915,928] [2024-11-07 08:20:46,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:20:46,082 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:20:46,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:46 WrapperNode [2024-11-07 08:20:46,083 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:20:46,084 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:20:46,086 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:20:46,086 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:20:46,091 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:20:46" (1/1) ... [2024-11-07 08:20:46,103 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:20:46" (1/1) ... [2024-11-07 08:20:46,139 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 141 [2024-11-07 08:20:46,139 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:20:46,140 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:20:46,140 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:20:46,140 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:20:46,148 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:46" (1/1) ... [2024-11-07 08:20:46,148 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:46" (1/1) ... [2024-11-07 08:20:46,150 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:46" (1/1) ... [2024-11-07 08:20:46,175 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:20:46,176 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:46" (1/1) ... [2024-11-07 08:20:46,176 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:46" (1/1) ... [2024-11-07 08:20:46,182 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:46" (1/1) ... [2024-11-07 08:20:46,186 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:46" (1/1) ... [2024-11-07 08:20:46,188 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:46" (1/1) ... [2024-11-07 08:20:46,189 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:46" (1/1) ... [2024-11-07 08:20:46,191 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:20:46,196 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:20:46,196 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:20:46,196 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:20:46,197 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:46" (1/1) ... [2024-11-07 08:20:46,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:20:46,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:20:46,232 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:20:46,235 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:20:46,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:20:46,259 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:20:46,260 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:20:46,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 08:20:46,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:20:46,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:20:46,331 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:20:46,333 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:20:46,690 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-07 08:20:46,690 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:20:46,702 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:20:46,702 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:20:46,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:20:46 BoogieIcfgContainer [2024-11-07 08:20:46,703 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:20:46,706 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:20:46,707 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:20:46,711 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:20:46,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:20:45" (1/3) ... [2024-11-07 08:20:46,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f227ea5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:20:46, skipping insertion in model container [2024-11-07 08:20:46,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:46" (2/3) ... [2024-11-07 08:20:46,713 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f227ea5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:20:46, skipping insertion in model container [2024-11-07 08:20:46,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:20:46" (3/3) ... [2024-11-07 08:20:46,715 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-44.i [2024-11-07 08:20:46,730 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:20:46,731 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:20:46,792 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:20:46,805 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;@6c791341, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:20:46,806 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:20:46,810 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 40 states have (on average 1.3) internal successors, (52), 41 states have internal predecessors, (52), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 08:20:46,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-07 08:20:46,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:20:46,848 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:20:46,848 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:20:46,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:20:46,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1077590006, now seen corresponding path program 1 times [2024-11-07 08:20:46,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:20:46,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235296455] [2024-11-07 08:20:46,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:20:46,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:20:46,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:47,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:20:47,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:47,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:20:47,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:47,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:20:47,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:47,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:20:47,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:47,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:20:47,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:47,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:20:47,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:47,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 08:20:47,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:47,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:20:47,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:47,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 08:20:47,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:47,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:20:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:47,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 08:20:47,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:47,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:20:47,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:47,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 08:20:47,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:47,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:20:47,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:47,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 08:20:47,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:47,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:20:47,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:47,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 08:20:47,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:47,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 08:20:47,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:47,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-07 08:20:47,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:47,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 08:20:47,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:47,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-07 08:20:47,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:47,239 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-07 08:20:47,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:20:47,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235296455] [2024-11-07 08:20:47,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235296455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:20:47,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:20:47,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:20:47,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336046393] [2024-11-07 08:20:47,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:20:47,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:20:47,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:20:47,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:20:47,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:20:47,267 INFO L87 Difference]: Start difference. First operand has 64 states, 40 states have (on average 1.3) internal successors, (52), 41 states have internal predecessors, (52), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-07 08:20:47,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:20:47,298 INFO L93 Difference]: Finished difference Result 125 states and 206 transitions. [2024-11-07 08:20:47,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:20:47,300 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 132 [2024-11-07 08:20:47,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:20:47,305 INFO L225 Difference]: With dead ends: 125 [2024-11-07 08:20:47,306 INFO L226 Difference]: Without dead ends: 60 [2024-11-07 08:20:47,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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:20:47,312 INFO L432 NwaCegarLoop]: 91 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, 91 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:20:47,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:20:47,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-07 08:20:47,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-07 08:20:47,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 08:20:47,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 87 transitions. [2024-11-07 08:20:47,355 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 87 transitions. Word has length 132 [2024-11-07 08:20:47,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:20:47,356 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 87 transitions. [2024-11-07 08:20:47,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-07 08:20:47,357 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 87 transitions. [2024-11-07 08:20:47,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-07 08:20:47,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:20:47,359 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:20:47,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 08:20:47,360 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:20:47,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:20:47,360 INFO L85 PathProgramCache]: Analyzing trace with hash 993095288, now seen corresponding path program 1 times [2024-11-07 08:20:47,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:20:47,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677355512] [2024-11-07 08:20:47,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:20:47,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:20:47,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:22:16,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:22:16,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:22:16,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:22:16,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:22:16,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:22:16,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:22:16,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:22:16,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:22:16,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:22:16,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:22:16,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:22:16,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:22:16,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 08:22:16,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:22:16,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:22:16,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:22:16,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 08:22:16,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:22:16,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:22:16,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:22:16,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 08:22:16,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:22:16,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:22:16,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:22:16,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 08:22:16,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:22:16,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:22:16,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:22:16,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 08:22:16,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:22:16,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:22:16,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:22:16,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 08:22:16,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:22:16,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 08:22:16,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:22:16,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-07 08:22:16,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:22:16,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 08:22:16,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:22:16,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-07 08:22:16,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:22:16,955 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-07 08:22:16,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:22:16,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677355512] [2024-11-07 08:22:16,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677355512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:22:16,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:22:16,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 08:22:16,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988460408] [2024-11-07 08:22:16,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:22:16,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 08:22:16,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:22:16,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 08:22:16,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-07 08:22:16,962 INFO L87 Difference]: Start difference. First operand 60 states and 87 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 08:22:18,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:22:18,067 INFO L93 Difference]: Finished difference Result 151 states and 215 transitions. [2024-11-07 08:22:18,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 08:22:18,070 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 132 [2024-11-07 08:22:18,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:22:18,073 INFO L225 Difference]: With dead ends: 151 [2024-11-07 08:22:18,075 INFO L226 Difference]: Without dead ends: 94 [2024-11-07 08:22:18,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 08:22:18,076 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 92 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 08:22:18,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 352 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 08:22:18,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-07 08:22:18,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 81. [2024-11-07 08:22:18,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 50 states have (on average 1.2) internal successors, (60), 51 states have internal predecessors, (60), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 08:22:18,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 116 transitions. [2024-11-07 08:22:18,101 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 116 transitions. Word has length 132 [2024-11-07 08:22:18,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:22:18,102 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 116 transitions. [2024-11-07 08:22:18,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 08:22:18,102 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 116 transitions. [2024-11-07 08:22:18,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-07 08:22:18,104 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:22:18,105 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:22:18,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 08:22:18,105 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:22:18,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:22:18,106 INFO L85 PathProgramCache]: Analyzing trace with hash -429715755, now seen corresponding path program 1 times [2024-11-07 08:22:18,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:22:18,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033388198] [2024-11-07 08:22:18,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:22:18,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:22:18,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat