./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-31.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_fillercode_fillercodestructure_filler-pe-cn_file-31.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', '5ff9df1980cb7273f3fa10307de3c5cadee6843da6e01ca90c69648d1790f06c'] 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_fillercode_fillercodestructure_filler-pe-cn_file-31.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 5ff9df1980cb7273f3fa10307de3c5cadee6843da6e01ca90c69648d1790f06c --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 05:56:18,122 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 05:56:18,206 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 05:56:18,219 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 05:56:18,220 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 05:56:18,250 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 05:56:18,251 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 05:56:18,251 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 05:56:18,251 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 05:56:18,251 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 05:56:18,251 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 05:56:18,252 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 05:56:18,252 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 05:56:18,252 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 05:56:18,253 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 05:56:18,253 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 05:56:18,254 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 05:56:18,254 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 05:56:18,254 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 05:56:18,254 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 05:56:18,254 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 05:56:18,254 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 05:56:18,254 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 05:56:18,254 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 05:56:18,254 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 05:56:18,254 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 05:56:18,255 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 05:56:18,255 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 05:56:18,255 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 05:56:18,255 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 05:56:18,255 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 05:56:18,255 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 05:56:18,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:56:18,256 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 05:56:18,256 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 05:56:18,256 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 05:56:18,256 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 05:56:18,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 05:56:18,257 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 05:56:18,257 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 05:56:18,257 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 05:56:18,257 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 05:56:18,257 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 -> 5ff9df1980cb7273f3fa10307de3c5cadee6843da6e01ca90c69648d1790f06c [2024-11-07 05:56:18,545 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 05:56:18,553 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 05:56:18,557 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 05:56:18,559 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 05:56:18,559 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 05:56:18,560 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-31.i [2024-11-07 05:56:19,993 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 05:56:20,308 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 05:56:20,315 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-31.i [2024-11-07 05:56:20,327 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/69057a8c6/0402b4030b2e40eb802460b10446b134/FLAG93421692c [2024-11-07 05:56:20,349 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/69057a8c6/0402b4030b2e40eb802460b10446b134 [2024-11-07 05:56:20,353 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 05:56:20,356 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 05:56:20,357 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 05:56:20,357 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 05:56:20,361 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 05:56:20,362 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:56:20" (1/1) ... [2024-11-07 05:56:20,364 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ecc76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:56:20, skipping insertion in model container [2024-11-07 05:56:20,364 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:56:20" (1/1) ... [2024-11-07 05:56:20,388 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 05:56:20,519 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_fillercode_fillercodestructure_filler-pe-cn_file-31.i[919,932] [2024-11-07 05:56:20,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:56:20,642 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 05:56:20,655 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_fillercode_fillercodestructure_filler-pe-cn_file-31.i[919,932] [2024-11-07 05:56:20,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:56:20,734 INFO L204 MainTranslator]: Completed translation [2024-11-07 05:56:20,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:56:20 WrapperNode [2024-11-07 05:56:20,735 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 05:56:20,736 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 05:56:20,737 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 05:56:20,737 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 05:56:20,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:56:20" (1/1) ... [2024-11-07 05:56:20,758 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:56:20" (1/1) ... [2024-11-07 05:56:20,815 INFO L138 Inliner]: procedures = 26, calls = 67, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 287 [2024-11-07 05:56:20,815 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 05:56:20,816 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 05:56:20,816 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 05:56:20,816 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 05:56:20,835 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:56:20" (1/1) ... [2024-11-07 05:56:20,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:56:20" (1/1) ... [2024-11-07 05:56:20,839 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:56:20" (1/1) ... [2024-11-07 05:56:20,864 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 05:56:20,865 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:56:20" (1/1) ... [2024-11-07 05:56:20,865 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:56:20" (1/1) ... [2024-11-07 05:56:20,879 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:56:20" (1/1) ... [2024-11-07 05:56:20,886 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:56:20" (1/1) ... [2024-11-07 05:56:20,892 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:56:20" (1/1) ... [2024-11-07 05:56:20,896 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:56:20" (1/1) ... [2024-11-07 05:56:20,903 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 05:56:20,905 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 05:56:20,905 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 05:56:20,905 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 05:56:20,906 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:56:20" (1/1) ... [2024-11-07 05:56:20,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:56:20,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:56:20,942 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 05:56:20,945 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 05:56:20,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 05:56:20,970 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 05:56:20,971 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 05:56:20,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 05:56:20,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 05:56:20,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 05:56:21,081 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 05:56:21,082 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 05:56:21,598 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-07 05:56:21,598 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 05:56:21,615 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 05:56:21,615 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 05:56:21,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:56:21 BoogieIcfgContainer [2024-11-07 05:56:21,616 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 05:56:21,618 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 05:56:21,619 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 05:56:21,623 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 05:56:21,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:56:20" (1/3) ... [2024-11-07 05:56:21,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31284d3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:56:21, skipping insertion in model container [2024-11-07 05:56:21,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:56:20" (2/3) ... [2024-11-07 05:56:21,625 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31284d3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:56:21, skipping insertion in model container [2024-11-07 05:56:21,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:56:21" (3/3) ... [2024-11-07 05:56:21,627 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-cn_file-31.i [2024-11-07 05:56:21,640 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 05:56:21,640 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 05:56:21,688 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 05:56:21,702 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;@54a5729b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 05:56:21,703 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 05:56:21,710 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 72 states have (on average 1.375) internal successors, (99), 73 states have internal predecessors, (99), 54 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-07 05:56:21,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2024-11-07 05:56:21,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:56:21,725 INFO L215 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:21,726 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:56:21,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:56:21,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1501186268, now seen corresponding path program 1 times [2024-11-07 05:56:21,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:56:21,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630475912] [2024-11-07 05:56:21,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:56:21,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:56:21,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:56:22,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:56:22,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:56:22,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:56:22,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:56:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:56:22,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:56:22,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:56:22,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:56:22,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:56:22,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:56:22,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 05:56:22,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:56:22,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 05:56:22,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:56:22,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 05:56:22,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:56:22,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 05:56:22,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:56:22,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 05:56:22,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 05:56:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 05:56:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 05:56:22,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 05:56:22,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 05:56:22,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 05:56:22,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 05:56:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 05:56:22,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 05:56:22,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-07 05:56:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-07 05:56:22,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-07 05:56:22,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-07 05:56:22,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-07 05:56:22,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-07 05:56:22,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-07 05:56:22,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-07 05:56:22,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-07 05:56:22,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-07 05:56:22,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2024-11-07 05:56:22,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2024-11-07 05:56:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-11-07 05:56:22,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-11-07 05:56:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-11-07 05:56:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-11-07 05:56:22,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-07 05:56:22,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2024-11-07 05:56:22,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-11-07 05:56:22,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-11-07 05:56:22,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2024-11-07 05:56:22,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2024-11-07 05:56:22,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2024-11-07 05:56:22,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2024-11-07 05:56:22,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2024-11-07 05:56:22,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:22,534 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2024-11-07 05:56:22,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:56:22,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630475912] [2024-11-07 05:56:22,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630475912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:56:22,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:56:22,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 05:56:22,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231333317] [2024-11-07 05:56:22,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:56:22,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 05:56:22,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:56:22,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 05:56:22,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 05:56:22,569 INFO L87 Difference]: Start difference. First operand has 129 states, 72 states have (on average 1.375) internal successors, (99), 73 states have internal predecessors, (99), 54 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 2 states have call successors, (54) [2024-11-07 05:56:22,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:56:22,616 INFO L93 Difference]: Finished difference Result 251 states and 462 transitions. [2024-11-07 05:56:22,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 05:56:22,618 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 2 states have call successors, (54) Word has length 323 [2024-11-07 05:56:22,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:56:22,625 INFO L225 Difference]: With dead ends: 251 [2024-11-07 05:56:22,625 INFO L226 Difference]: Without dead ends: 125 [2024-11-07 05:56:22,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 164 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 05:56:22,634 INFO L432 NwaCegarLoop]: 200 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, 200 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 05:56:22,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:56:22,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-07 05:56:22,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2024-11-07 05:56:22,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 69 states have (on average 1.3333333333333333) internal successors, (92), 69 states have internal predecessors, (92), 54 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-07 05:56:22,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 200 transitions. [2024-11-07 05:56:22,693 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 200 transitions. Word has length 323 [2024-11-07 05:56:22,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:56:22,694 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 200 transitions. [2024-11-07 05:56:22,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 2 states have call successors, (54) [2024-11-07 05:56:22,694 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 200 transitions. [2024-11-07 05:56:22,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2024-11-07 05:56:22,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:56:22,700 INFO L215 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:22,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 05:56:22,701 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:56:22,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:56:22,704 INFO L85 PathProgramCache]: Analyzing trace with hash 411802328, now seen corresponding path program 1 times [2024-11-07 05:56:22,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:56:22,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031065230] [2024-11-07 05:56:22,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:56:22,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:56:22,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:56:23,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:56:23,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:56:23,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:56:23,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:56:23,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:56:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:56:23,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:56:23,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:56:23,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:56:23,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:56:23,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 05:56:23,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:56:23,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 05:56:23,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:56:23,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 05:56:23,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:56:23,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 05:56:23,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:56:23,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 05:56:23,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 05:56:23,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 05:56:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 05:56:23,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 05:56:23,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 05:56:23,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 05:56:23,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 05:56:23,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 05:56:23,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 05:56:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-07 05:56:23,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-07 05:56:23,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-07 05:56:23,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-07 05:56:23,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-07 05:56:23,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-07 05:56:23,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-07 05:56:23,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-07 05:56:23,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-07 05:56:23,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-07 05:56:23,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2024-11-07 05:56:23,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2024-11-07 05:56:23,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-11-07 05:56:23,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-11-07 05:56:23,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-11-07 05:56:23,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-11-07 05:56:23,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-07 05:56:23,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2024-11-07 05:56:23,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-11-07 05:56:23,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-11-07 05:56:23,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2024-11-07 05:56:23,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2024-11-07 05:56:23,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2024-11-07 05:56:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2024-11-07 05:56:23,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2024-11-07 05:56:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:56:23,870 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2024-11-07 05:56:23,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:56:23,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031065230] [2024-11-07 05:56:23,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031065230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:56:23,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:56:23,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 05:56:23,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540623045] [2024-11-07 05:56:23,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:56:23,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 05:56:23,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:56:23,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 05:56:23,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 05:56:23,877 INFO L87 Difference]: Start difference. First operand 125 states and 200 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2024-11-07 05:56:24,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:56:24,220 INFO L93 Difference]: Finished difference Result 370 states and 596 transitions. [2024-11-07 05:56:24,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 05:56:24,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) Word has length 323 [2024-11-07 05:56:24,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:56:24,227 INFO L225 Difference]: With dead ends: 370 [2024-11-07 05:56:24,230 INFO L226 Difference]: Without dead ends: 248 [2024-11-07 05:56:24,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 05:56:24,232 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 99 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 05:56:24,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 473 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 05:56:24,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-11-07 05:56:24,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 245. [2024-11-07 05:56:24,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 134 states have (on average 1.335820895522388) internal successors, (179), 134 states have internal predecessors, (179), 108 states have call successors, (108), 2 states have call predecessors, (108), 2 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-07 05:56:24,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 395 transitions. [2024-11-07 05:56:24,310 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 395 transitions. Word has length 323 [2024-11-07 05:56:24,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:56:24,312 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 395 transitions. [2024-11-07 05:56:24,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2024-11-07 05:56:24,313 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 395 transitions. [2024-11-07 05:56:24,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2024-11-07 05:56:24,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:56:24,316 INFO L215 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:24,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 05:56:24,316 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:56:24,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:56:24,317 INFO L85 PathProgramCache]: Analyzing trace with hash -2108157606, now seen corresponding path program 1 times [2024-11-07 05:56:24,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:56:24,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587242248] [2024-11-07 05:56:24,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:56:24,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:56:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat