./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-10.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_50-1loop_file-10.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', 'f04db10568a800b95189a827d616dfd35581f855ab463aa07cbc605d28fef196'] 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_50-1loop_file-10.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 f04db10568a800b95189a827d616dfd35581f855ab463aa07cbc605d28fef196 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:38:09,987 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:38:10,106 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:38:10,112 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:38:10,113 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:38:10,138 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:38:10,140 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:38:10,141 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:38:10,142 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:38:10,142 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:38:10,142 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:38:10,143 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:38:10,144 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:38:10,144 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:38:10,144 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:38:10,144 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:38:10,144 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:38:10,145 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:38:10,145 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 08:38:10,145 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:38:10,145 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:38:10,145 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:38:10,145 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:38:10,146 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:38:10,146 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:38:10,146 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:38:10,146 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:38:10,146 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:38:10,146 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:38:10,147 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:38:10,147 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:38:10,147 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:38:10,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:38:10,147 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:38:10,148 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:38:10,148 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:38:10,148 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 08:38:10,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 08:38:10,149 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:38:10,149 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:38:10,149 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:38:10,149 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:38:10,149 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 -> f04db10568a800b95189a827d616dfd35581f855ab463aa07cbc605d28fef196 [2024-11-07 08:38:10,456 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:38:10,464 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:38:10,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:38:10,470 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:38:10,470 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:38:10,471 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-10.i [2024-11-07 08:38:11,882 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:38:12,122 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:38:12,125 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-10.i [2024-11-07 08:38:12,135 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/507178c8a/fec4395b2eba4e57b3ec51f751d1c0ae/FLAG10478b42b [2024-11-07 08:38:12,158 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/507178c8a/fec4395b2eba4e57b3ec51f751d1c0ae [2024-11-07 08:38:12,161 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:38:12,163 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:38:12,166 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:38:12,166 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:38:12,171 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:38:12,172 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:38:12" (1/1) ... [2024-11-07 08:38:12,175 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29333c3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:38:12, skipping insertion in model container [2024-11-07 08:38:12,175 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:38:12" (1/1) ... [2024-11-07 08:38:12,193 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:38:12,333 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_50-1loop_file-10.i[915,928] [2024-11-07 08:38:12,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:38:12,441 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:38:12,452 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_50-1loop_file-10.i[915,928] [2024-11-07 08:38:12,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:38:12,519 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:38:12,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:38:12 WrapperNode [2024-11-07 08:38:12,521 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:38:12,522 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:38:12,523 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:38:12,523 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:38:12,529 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:38:12" (1/1) ... [2024-11-07 08:38:12,544 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:38:12" (1/1) ... [2024-11-07 08:38:12,603 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 171 [2024-11-07 08:38:12,604 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:38:12,605 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:38:12,605 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:38:12,605 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:38:12,613 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:38:12" (1/1) ... [2024-11-07 08:38:12,614 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:38:12" (1/1) ... [2024-11-07 08:38:12,617 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:38:12" (1/1) ... [2024-11-07 08:38:12,654 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:38:12,656 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:38:12" (1/1) ... [2024-11-07 08:38:12,656 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:38:12" (1/1) ... [2024-11-07 08:38:12,667 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:38:12" (1/1) ... [2024-11-07 08:38:12,675 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:38:12" (1/1) ... [2024-11-07 08:38:12,681 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:38:12" (1/1) ... [2024-11-07 08:38:12,683 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:38:12" (1/1) ... [2024-11-07 08:38:12,689 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:38:12,692 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:38:12,693 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:38:12,694 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:38:12,695 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:38:12" (1/1) ... [2024-11-07 08:38:12,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:38:12,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:38:12,731 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:38:12,735 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:38:12,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:38:12,759 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:38:12,759 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:38:12,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 08:38:12,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:38:12,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:38:12,842 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:38:12,844 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:38:13,236 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2024-11-07 08:38:13,236 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:38:13,248 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:38:13,251 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:38:13,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:38:13 BoogieIcfgContainer [2024-11-07 08:38:13,251 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:38:13,253 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:38:13,254 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:38:13,259 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:38:13,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:38:12" (1/3) ... [2024-11-07 08:38:13,260 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a196cc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:38:13, skipping insertion in model container [2024-11-07 08:38:13,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:38:12" (2/3) ... [2024-11-07 08:38:13,260 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a196cc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:38:13, skipping insertion in model container [2024-11-07 08:38:13,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:38:13" (3/3) ... [2024-11-07 08:38:13,261 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-10.i [2024-11-07 08:38:13,277 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:38:13,277 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:38:13,352 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:38:13,365 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;@3784b2cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:38:13,365 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:38:13,372 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 55 states have internal predecessors, (75), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 08:38:13,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-07 08:38:13,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:38:13,385 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:13,386 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:38:13,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:38:13,389 INFO L85 PathProgramCache]: Analyzing trace with hash -20554845, now seen corresponding path program 1 times [2024-11-07 08:38:13,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:38:13,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828729817] [2024-11-07 08:38:13,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:38:13,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:38:13,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:14,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:38:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:14,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:38:14,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:14,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:38:14,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:14,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:38:14,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:14,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:38:14,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:14,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:38:14,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:14,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:38:14,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:14,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:38:14,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:14,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:38:14,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:14,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:38:14,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:14,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:38:14,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:14,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:38:14,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:14,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:38:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:14,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:38:14,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:14,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:38:14,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:14,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:38:14,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:14,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 08:38:14,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:14,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 08:38:14,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:14,380 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 08:38:14,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:38:14,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828729817] [2024-11-07 08:38:14,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828729817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:38:14,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:38:14,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 08:38:14,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832807295] [2024-11-07 08:38:14,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:38:14,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 08:38:14,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:38:14,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 08:38:14,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:38:14,423 INFO L87 Difference]: Start difference. First operand has 75 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 55 states have internal predecessors, (75), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 08:38:14,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:38:14,705 INFO L93 Difference]: Finished difference Result 224 states and 369 transitions. [2024-11-07 08:38:14,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 08:38:14,709 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 122 [2024-11-07 08:38:14,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:38:14,719 INFO L225 Difference]: With dead ends: 224 [2024-11-07 08:38:14,720 INFO L226 Difference]: Without dead ends: 140 [2024-11-07 08:38:14,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 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:38:14,728 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 85 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 08:38:14,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 404 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 08:38:14,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-07 08:38:14,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 105. [2024-11-07 08:38:14,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 66 states have (on average 1.2575757575757576) internal successors, (83), 66 states have internal predecessors, (83), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 08:38:14,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 155 transitions. [2024-11-07 08:38:14,782 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 155 transitions. Word has length 122 [2024-11-07 08:38:14,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:38:14,783 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 155 transitions. [2024-11-07 08:38:14,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 08:38:14,784 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 155 transitions. [2024-11-07 08:38:14,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-07 08:38:14,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:38:14,786 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:14,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 08:38:14,787 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:38:14,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:38:14,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1886821089, now seen corresponding path program 1 times [2024-11-07 08:38:14,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:38:14,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835739044] [2024-11-07 08:38:14,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:38:14,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:38:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:33,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:38:33,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:33,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:38:33,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:33,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:38:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:33,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:38:33,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:33,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:38:33,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:33,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:38:33,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:33,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:38:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:33,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:38:33,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:33,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:38:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:33,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:38:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:33,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:38:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:33,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:38:33,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:33,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:38:33,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:33,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:38:33,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:33,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:38:33,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:33,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:38:33,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:33,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 08:38:33,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:33,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 08:38:33,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:33,758 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 08:38:33,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:38:33,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835739044] [2024-11-07 08:38:33,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835739044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:38:33,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:38:33,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-07 08:38:33,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264292331] [2024-11-07 08:38:33,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:38:33,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 08:38:33,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:38:33,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 08:38:33,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-07 08:38:33,766 INFO L87 Difference]: Start difference. First operand 105 states and 155 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-07 08:38:36,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:38:36,943 INFO L93 Difference]: Finished difference Result 385 states and 540 transitions. [2024-11-07 08:38:36,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 08:38:36,944 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 123 [2024-11-07 08:38:36,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:38:36,951 INFO L225 Difference]: With dead ends: 385 [2024-11-07 08:38:36,951 INFO L226 Difference]: Without dead ends: 317 [2024-11-07 08:38:36,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=215, Invalid=655, Unknown=0, NotChecked=0, Total=870 [2024-11-07 08:38:36,953 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 832 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 832 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 08:38:36,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [832 Valid, 617 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 08:38:36,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-11-07 08:38:36,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 136. [2024-11-07 08:38:36,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 95 states have (on average 1.2947368421052632) internal successors, (123), 95 states have internal predecessors, (123), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 08:38:36,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 195 transitions. [2024-11-07 08:38:36,991 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 195 transitions. Word has length 123 [2024-11-07 08:38:36,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:38:36,992 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 195 transitions. [2024-11-07 08:38:36,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-07 08:38:36,992 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 195 transitions. [2024-11-07 08:38:36,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-07 08:38:36,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:38:36,997 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:36,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 08:38:36,997 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:38:36,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:38:36,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1206762719, now seen corresponding path program 1 times [2024-11-07 08:38:36,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:38:36,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671890281] [2024-11-07 08:38:36,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:38:36,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:38:37,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:53,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:38:53,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:53,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:38:53,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:53,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:38:53,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:53,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:38:53,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:53,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:38:53,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:53,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:38:53,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:53,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:38:53,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:53,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:38:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:53,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:38:53,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:53,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:38:53,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:53,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:38:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:53,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:38:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:53,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:38:53,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:53,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:38:53,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:53,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:38:53,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:54,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:38:54,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:54,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 08:38:54,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:54,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 08:38:54,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:38:54,027 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 08:38:54,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:38:54,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671890281] [2024-11-07 08:38:54,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671890281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:38:54,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:38:54,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-07 08:38:54,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445441293] [2024-11-07 08:38:54,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:38:54,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-07 08:38:54,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:38:54,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-07 08:38:54,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2024-11-07 08:38:54,032 INFO L87 Difference]: Start difference. First operand 136 states and 195 transitions. Second operand has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-07 08:38:57,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:38:57,161 INFO L93 Difference]: Finished difference Result 427 states and 601 transitions. [2024-11-07 08:38:57,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 08:38:57,162 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 123 [2024-11-07 08:38:57,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:38:57,166 INFO L225 Difference]: With dead ends: 427 [2024-11-07 08:38:57,168 INFO L226 Difference]: Without dead ends: 359 [2024-11-07 08:38:57,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=244, Invalid=812, Unknown=0, NotChecked=0, Total=1056 [2024-11-07 08:38:57,173 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 742 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 1327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 08:38:57,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [742 Valid, 645 Invalid, 1327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1247 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 08:38:57,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-11-07 08:38:57,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 218. [2024-11-07 08:38:57,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 156 states have (on average 1.3012820512820513) internal successors, (203), 156 states have internal predecessors, (203), 54 states have call successors, (54), 7 states have call predecessors, (54), 7 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-07 08:38:57,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 311 transitions. [2024-11-07 08:38:57,212 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 311 transitions. Word has length 123 [2024-11-07 08:38:57,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:38:57,214 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 311 transitions. [2024-11-07 08:38:57,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-07 08:38:57,214 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 311 transitions. [2024-11-07 08:38:57,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-07 08:38:57,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:38:57,219 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:57,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 08:38:57,219 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:38:57,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:38:57,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1260020767, now seen corresponding path program 1 times [2024-11-07 08:38:57,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:38:57,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339437093] [2024-11-07 08:38:57,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:38:57,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:38:57,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat