./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-98.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_fillercodesize_ps-cn-100_file-98.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', '184e37531f75678a35e3524a829bba470e1f2673255cf1cb9b451a6dd4595a7b'] 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_fillercodesize_ps-cn-100_file-98.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 184e37531f75678a35e3524a829bba470e1f2673255cf1cb9b451a6dd4595a7b --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 04:50:27,268 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 04:50:27,358 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 04:50:27,369 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 04:50:27,369 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 04:50:27,400 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 04:50:27,401 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 04:50:27,401 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 04:50:27,401 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 04:50:27,401 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 04:50:27,401 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 04:50:27,401 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 04:50:27,402 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 04:50:27,402 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 04:50:27,402 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 04:50:27,402 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 04:50:27,402 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 04:50:27,402 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 04:50:27,402 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 04:50:27,402 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 04:50:27,402 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 04:50:27,403 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 04:50:27,403 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 04:50:27,403 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 04:50:27,403 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 04:50:27,403 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 04:50:27,403 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 04:50:27,403 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 04:50:27,403 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 04:50:27,403 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 04:50:27,403 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 04:50:27,403 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 04:50:27,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:50:27,404 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 04:50:27,404 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 04:50:27,404 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 04:50:27,404 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 04:50:27,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 04:50:27,404 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 04:50:27,404 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 04:50:27,404 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 04:50:27,404 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 04:50:27,404 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 -> 184e37531f75678a35e3524a829bba470e1f2673255cf1cb9b451a6dd4595a7b [2024-11-07 04:50:27,736 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 04:50:27,745 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 04:50:27,748 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 04:50:27,749 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 04:50:27,749 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 04:50:27,752 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-98.i [2024-11-07 04:50:29,166 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 04:50:29,435 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 04:50:29,436 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-98.i [2024-11-07 04:50:29,445 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7b71b6ae0/875509851b1d4c6e8e49e9021e8270d4/FLAG24911d505 [2024-11-07 04:50:29,458 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7b71b6ae0/875509851b1d4c6e8e49e9021e8270d4 [2024-11-07 04:50:29,460 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 04:50:29,462 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 04:50:29,463 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 04:50:29,463 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 04:50:29,466 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 04:50:29,467 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:50:29" (1/1) ... [2024-11-07 04:50:29,468 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@308030cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:29, skipping insertion in model container [2024-11-07 04:50:29,468 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:50:29" (1/1) ... [2024-11-07 04:50:29,489 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 04:50:29,641 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_fillercodesize_ps-cn-100_file-98.i[916,929] [2024-11-07 04:50:29,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:50:29,801 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 04:50:29,814 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_fillercodesize_ps-cn-100_file-98.i[916,929] [2024-11-07 04:50:29,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:50:29,912 INFO L204 MainTranslator]: Completed translation [2024-11-07 04:50:29,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:29 WrapperNode [2024-11-07 04:50:29,913 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 04:50:29,915 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 04:50:29,915 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 04:50:29,915 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 04:50:29,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:29" (1/1) ... [2024-11-07 04:50:29,937 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:29" (1/1) ... [2024-11-07 04:50:30,003 INFO L138 Inliner]: procedures = 26, calls = 66, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 329 [2024-11-07 04:50:30,003 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 04:50:30,004 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 04:50:30,004 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 04:50:30,004 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 04:50:30,017 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:29" (1/1) ... [2024-11-07 04:50:30,018 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:29" (1/1) ... [2024-11-07 04:50:30,024 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:29" (1/1) ... [2024-11-07 04:50:30,044 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 04:50:30,045 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:29" (1/1) ... [2024-11-07 04:50:30,045 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:29" (1/1) ... [2024-11-07 04:50:30,068 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:29" (1/1) ... [2024-11-07 04:50:30,077 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:29" (1/1) ... [2024-11-07 04:50:30,084 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:29" (1/1) ... [2024-11-07 04:50:30,091 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:29" (1/1) ... [2024-11-07 04:50:30,105 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 04:50:30,106 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 04:50:30,106 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 04:50:30,106 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 04:50:30,108 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:29" (1/1) ... [2024-11-07 04:50:30,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:50:30,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:50:30,152 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 04:50:30,159 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 04:50:30,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 04:50:30,180 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 04:50:30,181 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 04:50:30,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 04:50:30,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 04:50:30,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 04:50:30,309 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 04:50:30,311 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 04:50:31,023 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-07 04:50:31,023 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 04:50:31,041 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 04:50:31,041 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 04:50:31,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:50:31 BoogieIcfgContainer [2024-11-07 04:50:31,042 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 04:50:31,044 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 04:50:31,044 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 04:50:31,049 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 04:50:31,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:50:29" (1/3) ... [2024-11-07 04:50:31,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cacaa8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:50:31, skipping insertion in model container [2024-11-07 04:50:31,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:29" (2/3) ... [2024-11-07 04:50:31,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cacaa8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:50:31, skipping insertion in model container [2024-11-07 04:50:31,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:50:31" (3/3) ... [2024-11-07 04:50:31,052 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-98.i [2024-11-07 04:50:31,067 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 04:50:31,068 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 04:50:31,130 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 04:50:31,141 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;@60001728, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 04:50:31,141 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 04:50:31,147 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 88 states have (on average 1.4545454545454546) internal successors, (128), 89 states have internal predecessors, (128), 53 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2024-11-07 04:50:31,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2024-11-07 04:50:31,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:50:31,175 INFO L215 NwaCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:50:31,176 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:50:31,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:50:31,182 INFO L85 PathProgramCache]: Analyzing trace with hash -78574147, now seen corresponding path program 1 times [2024-11-07 04:50:31,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:50:31,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681012367] [2024-11-07 04:50:31,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:50:31,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:50:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:32,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:50:32,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:32,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:50:32,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:32,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 04:50:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:32,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:50:32,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:32,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 04:50:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:33,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 04:50:33,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:33,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 04:50:33,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:33,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:50:33,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:33,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:50:33,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:33,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:50:33,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:33,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:50:33,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:33,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:50:33,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:33,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 04:50:33,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:33,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:50:33,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:33,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:50:33,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:33,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:50:33,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:33,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:50:33,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:33,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:50:33,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:33,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:50:33,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:33,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:50:33,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:33,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:50:33,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:33,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 04:50:33,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:33,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 04:50:33,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:33,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 04:50:33,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:33,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 04:50:33,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:33,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 04:50:33,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:33,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 04:50:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:33,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 04:50:33,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:33,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-07 04:50:33,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:33,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 04:50:33,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:33,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-07 04:50:33,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:33,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 04:50:33,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:33,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-07 04:50:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:33,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-07 04:50:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:33,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-07 04:50:33,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:33,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-11-07 04:50:33,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:33,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2024-11-07 04:50:33,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:33,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2024-11-07 04:50:33,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:33,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-11-07 04:50:33,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:33,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-11-07 04:50:33,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:33,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2024-11-07 04:50:33,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:33,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-11-07 04:50:33,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:33,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-11-07 04:50:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:33,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-11-07 04:50:33,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:33,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-11-07 04:50:33,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:33,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-07 04:50:33,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:33,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2024-11-07 04:50:33,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:33,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-11-07 04:50:33,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:33,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-11-07 04:50:33,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:33,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2024-11-07 04:50:33,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:33,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2024-11-07 04:50:33,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:33,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2024-11-07 04:50:33,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:33,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2024-11-07 04:50:33,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:33,225 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2024-11-07 04:50:33,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:50:33,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681012367] [2024-11-07 04:50:33,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681012367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:50:33,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:50:33,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 04:50:33,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908530542] [2024-11-07 04:50:33,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:50:33,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 04:50:33,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:50:33,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 04:50:33,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 04:50:33,258 INFO L87 Difference]: Start difference. First operand has 144 states, 88 states have (on average 1.4545454545454546) internal successors, (128), 89 states have internal predecessors, (128), 53 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2024-11-07 04:50:33,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:50:33,331 INFO L93 Difference]: Finished difference Result 282 states and 517 transitions. [2024-11-07 04:50:33,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 04:50:33,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) Word has length 328 [2024-11-07 04:50:33,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:50:33,345 INFO L225 Difference]: With dead ends: 282 [2024-11-07 04:50:33,345 INFO L226 Difference]: Without dead ends: 141 [2024-11-07 04:50:33,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 04:50:33,357 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 0 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 04:50:33,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 446 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:50:33,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-07 04:50:33,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2024-11-07 04:50:33,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 86 states have internal predecessors, (122), 53 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2024-11-07 04:50:33,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 228 transitions. [2024-11-07 04:50:33,430 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 228 transitions. Word has length 328 [2024-11-07 04:50:33,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:50:33,435 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 228 transitions. [2024-11-07 04:50:33,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2024-11-07 04:50:33,436 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 228 transitions. [2024-11-07 04:50:33,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2024-11-07 04:50:33,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:50:33,447 INFO L215 NwaCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:50:33,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 04:50:33,447 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:50:33,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:50:33,448 INFO L85 PathProgramCache]: Analyzing trace with hash -2085392666, now seen corresponding path program 1 times [2024-11-07 04:50:33,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:50:33,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773685632] [2024-11-07 04:50:33,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:50:33,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:50:33,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:50:34,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:50:34,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 04:50:34,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:50:34,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 04:50:34,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 04:50:34,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 04:50:34,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:50:34,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:50:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:50:34,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:50:34,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:50:34,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 04:50:34,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:50:34,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:50:34,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:50:34,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:50:34,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:50:34,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:50:34,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:50:34,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:50:34,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 04:50:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 04:50:34,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 04:50:34,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 04:50:34,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 04:50:34,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 04:50:34,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 04:50:34,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-07 04:50:34,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 04:50:34,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-07 04:50:34,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 04:50:34,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-07 04:50:34,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-07 04:50:34,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-07 04:50:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-11-07 04:50:34,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2024-11-07 04:50:34,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2024-11-07 04:50:34,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-11-07 04:50:34,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-11-07 04:50:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2024-11-07 04:50:34,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-11-07 04:50:34,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-11-07 04:50:34,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-11-07 04:50:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-11-07 04:50:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-07 04:50:34,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2024-11-07 04:50:34,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-11-07 04:50:34,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-11-07 04:50:34,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2024-11-07 04:50:34,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2024-11-07 04:50:34,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2024-11-07 04:50:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2024-11-07 04:50:34,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:34,962 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2024-11-07 04:50:34,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:50:34,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773685632] [2024-11-07 04:50:34,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773685632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:50:34,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:50:34,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 04:50:34,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290123191] [2024-11-07 04:50:34,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:50:34,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 04:50:34,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:50:34,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 04:50:34,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 04:50:34,966 INFO L87 Difference]: Start difference. First operand 141 states and 228 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2024-11-07 04:50:35,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:50:35,075 INFO L93 Difference]: Finished difference Result 286 states and 464 transitions. [2024-11-07 04:50:35,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 04:50:35,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) Word has length 329 [2024-11-07 04:50:35,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:50:35,083 INFO L225 Difference]: With dead ends: 286 [2024-11-07 04:50:35,083 INFO L226 Difference]: Without dead ends: 148 [2024-11-07 04:50:35,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 04:50:35,088 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 19 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 04:50:35,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 424 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 04:50:35,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-07 04:50:35,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 141. [2024-11-07 04:50:35,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 86 states have (on average 1.4069767441860466) internal successors, (121), 86 states have internal predecessors, (121), 53 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2024-11-07 04:50:35,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 227 transitions. [2024-11-07 04:50:35,117 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 227 transitions. Word has length 329 [2024-11-07 04:50:35,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:50:35,119 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 227 transitions. [2024-11-07 04:50:35,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2024-11-07 04:50:35,120 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 227 transitions. [2024-11-07 04:50:35,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2024-11-07 04:50:35,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:50:35,126 INFO L215 NwaCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:50:35,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 04:50:35,126 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:50:35,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:50:35,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1827227228, now seen corresponding path program 1 times [2024-11-07 04:50:35,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:50:35,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150581586] [2024-11-07 04:50:35,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:50:35,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:50:35,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:39,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:50:39,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:39,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:50:39,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:39,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 04:50:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:39,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:50:39,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:39,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 04:50:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:39,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 04:50:39,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:39,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 04:50:39,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:39,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:50:39,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:39,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:50:39,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:39,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:50:39,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:39,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:50:39,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:39,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:50:39,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:39,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 04:50:39,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:39,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:50:39,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:39,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:50:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:39,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:50:39,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:39,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:50:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:39,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:50:39,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:39,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:50:39,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:39,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:50:39,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:39,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:50:39,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:39,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 04:50:39,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:39,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 04:50:39,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:39,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 04:50:39,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:39,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 04:50:39,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:39,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 04:50:39,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:39,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 04:50:39,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:39,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 04:50:39,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:39,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-07 04:50:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:39,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 04:50:39,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:39,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-07 04:50:39,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:39,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 04:50:39,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:39,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-07 04:50:39,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:39,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-07 04:50:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:39,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-07 04:50:39,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:39,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-11-07 04:50:39,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:39,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2024-11-07 04:50:39,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:39,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2024-11-07 04:50:39,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:39,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-11-07 04:50:39,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:39,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-11-07 04:50:39,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:39,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2024-11-07 04:50:39,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:39,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-11-07 04:50:39,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:39,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-11-07 04:50:39,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:39,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-11-07 04:50:39,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:39,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-11-07 04:50:39,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:39,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-07 04:50:39,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:39,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2024-11-07 04:50:39,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:39,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-11-07 04:50:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:39,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-11-07 04:50:39,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:39,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2024-11-07 04:50:39,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:39,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2024-11-07 04:50:39,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:39,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2024-11-07 04:50:40,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:40,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2024-11-07 04:50:40,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:50:40,012 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2024-11-07 04:50:40,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:50:40,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150581586] [2024-11-07 04:50:40,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150581586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:50:40,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:50:40,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 04:50:40,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721610916] [2024-11-07 04:50:40,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:50:40,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 04:50:40,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:50:40,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 04:50:40,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-07 04:50:40,017 INFO L87 Difference]: Start difference. First operand 141 states and 227 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2024-11-07 04:50:41,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:50:41,174 INFO L93 Difference]: Finished difference Result 577 states and 930 transitions. [2024-11-07 04:50:41,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 04:50:41,175 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) Word has length 329 [2024-11-07 04:50:41,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:50:41,180 INFO L225 Difference]: With dead ends: 577 [2024-11-07 04:50:41,181 INFO L226 Difference]: Without dead ends: 439 [2024-11-07 04:50:41,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-07 04:50:41,183 INFO L432 NwaCegarLoop]: 396 mSDtfsCounter, 623 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 04:50:41,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 774 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 04:50:41,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-11-07 04:50:41,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 317. [2024-11-07 04:50:41,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 189 states have (on average 1.380952380952381) internal successors, (261), 190 states have internal predecessors, (261), 124 states have call successors, (124), 3 states have call predecessors, (124), 3 states have return successors, (124), 123 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-07 04:50:41,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 509 transitions. [2024-11-07 04:50:41,319 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 509 transitions. Word has length 329 [2024-11-07 04:50:41,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:50:41,320 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 509 transitions. [2024-11-07 04:50:41,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2024-11-07 04:50:41,320 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 509 transitions. [2024-11-07 04:50:41,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2024-11-07 04:50:41,328 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:50:41,328 INFO L215 NwaCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:50:41,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 04:50:41,330 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:50:41,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:50:41,330 INFO L85 PathProgramCache]: Analyzing trace with hash -52219866, now seen corresponding path program 1 times [2024-11-07 04:50:41,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:50:41,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282328818] [2024-11-07 04:50:41,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:50:41,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:50:41,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat