./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-85.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_variablewrapping_wrapper-sp_file-85.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', 'b6858d7ad4c18c794513a22d865d2c5f534c26019d86192f01977447e1926b47'] 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_variablewrapping_wrapper-sp_file-85.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 b6858d7ad4c18c794513a22d865d2c5f534c26019d86192f01977447e1926b47 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 11:01:10,256 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 11:01:10,320 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 11:01:10,324 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 11:01:10,324 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 11:01:10,337 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 11:01:10,337 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 11:01:10,338 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 11:01:10,338 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 11:01:10,341 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 11:01:10,341 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 11:01:10,341 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 11:01:10,341 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 11:01:10,341 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 11:01:10,341 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 11:01:10,341 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 11:01:10,341 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 11:01:10,341 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 11:01:10,341 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 11:01:10,341 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 11:01:10,341 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 11:01:10,341 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 11:01:10,341 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 11:01:10,341 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 11:01:10,342 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 11:01:10,342 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 11:01:10,342 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 11:01:10,342 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 11:01:10,342 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 11:01:10,342 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 11:01:10,342 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 11:01:10,342 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 11:01:10,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 11:01:10,342 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 11:01:10,342 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 11:01:10,342 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 11:01:10,342 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 11:01:10,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 11:01:10,342 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 11:01:10,342 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 11:01:10,342 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 11:01:10,342 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 11:01:10,342 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 -> b6858d7ad4c18c794513a22d865d2c5f534c26019d86192f01977447e1926b47 [2024-11-07 11:01:10,577 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 11:01:10,583 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 11:01:10,585 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 11:01:10,585 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 11:01:10,586 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 11:01:10,586 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-85.i [2024-11-07 11:01:11,698 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 11:01:11,911 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 11:01:11,911 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-85.i [2024-11-07 11:01:11,919 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d380ed8f7/e05aaae3962548c7831b31108bef34a9/FLAG2fac75564 [2024-11-07 11:01:11,931 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d380ed8f7/e05aaae3962548c7831b31108bef34a9 [2024-11-07 11:01:11,933 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 11:01:11,934 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 11:01:11,935 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 11:01:11,935 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 11:01:11,938 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 11:01:11,939 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:01:11" (1/1) ... [2024-11-07 11:01:11,939 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a0ef1ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:11, skipping insertion in model container [2024-11-07 11:01:11,939 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:01:11" (1/1) ... [2024-11-07 11:01:11,951 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 11:01:12,059 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_variablewrapping_wrapper-sp_file-85.i[917,930] [2024-11-07 11:01:12,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 11:01:12,128 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 11:01:12,135 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_variablewrapping_wrapper-sp_file-85.i[917,930] [2024-11-07 11:01:12,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 11:01:12,173 INFO L204 MainTranslator]: Completed translation [2024-11-07 11:01:12,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:12 WrapperNode [2024-11-07 11:01:12,174 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 11:01:12,175 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 11:01:12,175 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 11:01:12,175 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 11:01:12,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:12" (1/1) ... [2024-11-07 11:01:12,191 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:12" (1/1) ... [2024-11-07 11:01:12,225 INFO L138 Inliner]: procedures = 27, calls = 174, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 530 [2024-11-07 11:01:12,225 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 11:01:12,226 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 11:01:12,226 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 11:01:12,226 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 11:01:12,232 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:12" (1/1) ... [2024-11-07 11:01:12,232 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:12" (1/1) ... [2024-11-07 11:01:12,238 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:12" (1/1) ... [2024-11-07 11:01:12,264 INFO L175 MemorySlicer]: Split 140 memory accesses to 2 slices as follows [2, 138]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 40 writes are split as follows [0, 40]. [2024-11-07 11:01:12,265 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:12" (1/1) ... [2024-11-07 11:01:12,266 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:12" (1/1) ... [2024-11-07 11:01:12,280 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:12" (1/1) ... [2024-11-07 11:01:12,287 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:12" (1/1) ... [2024-11-07 11:01:12,292 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:12" (1/1) ... [2024-11-07 11:01:12,297 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:12" (1/1) ... [2024-11-07 11:01:12,300 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 11:01:12,305 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 11:01:12,305 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 11:01:12,305 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 11:01:12,306 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:12" (1/1) ... [2024-11-07 11:01:12,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 11:01:12,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 11:01:12,332 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 11:01:12,335 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 11:01:12,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 11:01:12,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-11-07 11:01:12,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-11-07 11:01:12,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 11:01:12,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 11:01:12,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 11:01:12,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 11:01:12,353 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 11:01:12,353 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 11:01:12,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 11:01:12,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 11:01:12,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 11:01:12,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 11:01:12,453 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 11:01:12,455 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 11:01:12,927 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2024-11-07 11:01:12,927 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 11:01:12,935 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 11:01:12,937 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 11:01:12,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:01:12 BoogieIcfgContainer [2024-11-07 11:01:12,937 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 11:01:12,939 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 11:01:12,939 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 11:01:12,942 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 11:01:12,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 11:01:11" (1/3) ... [2024-11-07 11:01:12,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d400ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:01:12, skipping insertion in model container [2024-11-07 11:01:12,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:12" (2/3) ... [2024-11-07 11:01:12,944 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d400ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:01:12, skipping insertion in model container [2024-11-07 11:01:12,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:01:12" (3/3) ... [2024-11-07 11:01:12,945 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-85.i [2024-11-07 11:01:12,954 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 11:01:12,955 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 11:01:12,998 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 11:01:13,008 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;@50285618, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 11:01:13,008 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 11:01:13,012 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 105 states have (on average 1.380952380952381) internal successors, (145), 106 states have internal predecessors, (145), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 11:01:13,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-07 11:01:13,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:01:13,024 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:01:13,024 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:01:13,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:01:13,028 INFO L85 PathProgramCache]: Analyzing trace with hash 809731980, now seen corresponding path program 1 times [2024-11-07 11:01:13,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:01:13,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137661296] [2024-11-07 11:01:13,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:13,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:01:13,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:13,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:01:13,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:13,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:01:13,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:13,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:01:13,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:13,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:01:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:13,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:01:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:13,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:01:13,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:13,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:01:13,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:13,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:01:13,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:13,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:01:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:13,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:01:13,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:13,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:01:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:13,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:01:13,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:13,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:01:13,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:13,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:01:13,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:13,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 11:01:13,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:13,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 11:01:13,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:13,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 11:01:13,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:13,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 11:01:13,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:13,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 11:01:13,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:13,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 11:01:13,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:13,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 11:01:13,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:13,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 11:01:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:13,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 11:01:13,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:13,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-07 11:01:13,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:01:13,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137661296] [2024-11-07 11:01:13,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137661296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:01:13,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:01:13,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 11:01:13,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263667108] [2024-11-07 11:01:13,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:01:13,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 11:01:13,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:01:13,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 11:01:13,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 11:01:13,461 INFO L87 Difference]: Start difference. First operand has 131 states, 105 states have (on average 1.380952380952381) internal successors, (145), 106 states have internal predecessors, (145), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-07 11:01:13,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:01:13,487 INFO L93 Difference]: Finished difference Result 255 states and 399 transitions. [2024-11-07 11:01:13,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 11:01:13,488 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 179 [2024-11-07 11:01:13,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:01:13,493 INFO L225 Difference]: With dead ends: 255 [2024-11-07 11:01:13,493 INFO L226 Difference]: Without dead ends: 127 [2024-11-07 11:01:13,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 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 11:01:13,498 INFO L432 NwaCegarLoop]: 184 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, 184 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 11:01:13,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 11:01:13,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-07 11:01:13,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-07 11:01:13,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 102 states have (on average 1.3529411764705883) internal successors, (138), 102 states have internal predecessors, (138), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 11:01:13,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 184 transitions. [2024-11-07 11:01:13,540 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 184 transitions. Word has length 179 [2024-11-07 11:01:13,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:01:13,540 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 184 transitions. [2024-11-07 11:01:13,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-07 11:01:13,542 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 184 transitions. [2024-11-07 11:01:13,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-07 11:01:13,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:01:13,545 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:01:13,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 11:01:13,545 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:01:13,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:01:13,546 INFO L85 PathProgramCache]: Analyzing trace with hash 949240606, now seen corresponding path program 1 times [2024-11-07 11:01:13,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:01:13,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302057546] [2024-11-07 11:01:13,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:13,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:01:13,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:17,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:01:17,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:17,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:01:17,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:17,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:01:17,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:17,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:01:17,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:17,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:01:17,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:17,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:01:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:17,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:01:17,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:17,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:01:17,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:17,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:01:17,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:17,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:01:17,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:17,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:01:17,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:17,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:01:17,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:17,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:01:17,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:17,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:01:17,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:17,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 11:01:17,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:17,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 11:01:17,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:17,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 11:01:17,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:17,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 11:01:17,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:17,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 11:01:17,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:17,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 11:01:17,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:17,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 11:01:17,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:17,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 11:01:17,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:17,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 11:01:17,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:17,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-07 11:01:17,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:01:17,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302057546] [2024-11-07 11:01:17,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302057546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:01:17,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:01:17,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-07 11:01:17,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130140690] [2024-11-07 11:01:17,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:01:17,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 11:01:17,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:01:17,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 11:01:17,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-07 11:01:17,298 INFO L87 Difference]: Start difference. First operand 127 states and 184 transitions. Second operand has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 14 states have internal predecessors, (67), 5 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 4 states have call predecessors, (23), 5 states have call successors, (23) [2024-11-07 11:01:18,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:01:18,130 INFO L93 Difference]: Finished difference Result 270 states and 393 transitions. [2024-11-07 11:01:18,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 11:01:18,132 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 14 states have internal predecessors, (67), 5 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 4 states have call predecessors, (23), 5 states have call successors, (23) Word has length 179 [2024-11-07 11:01:18,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:01:18,135 INFO L225 Difference]: With dead ends: 270 [2024-11-07 11:01:18,135 INFO L226 Difference]: Without dead ends: 146 [2024-11-07 11:01:18,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2024-11-07 11:01:18,139 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 482 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 11:01:18,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 579 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 11:01:18,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-07 11:01:18,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 141. [2024-11-07 11:01:18,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 116 states have (on average 1.3620689655172413) internal successors, (158), 116 states have internal predecessors, (158), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 11:01:18,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 204 transitions. [2024-11-07 11:01:18,156 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 204 transitions. Word has length 179 [2024-11-07 11:01:18,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:01:18,157 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 204 transitions. [2024-11-07 11:01:18,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 14 states have internal predecessors, (67), 5 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 4 states have call predecessors, (23), 5 states have call successors, (23) [2024-11-07 11:01:18,158 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 204 transitions. [2024-11-07 11:01:18,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-07 11:01:18,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:01:18,159 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:01:18,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 11:01:18,160 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:01:18,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:01:18,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1951990344, now seen corresponding path program 1 times [2024-11-07 11:01:18,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:01:18,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211463882] [2024-11-07 11:01:18,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:18,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:01:18,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:18,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:01:18,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:18,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:01:18,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:18,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:01:18,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:18,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:01:18,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:18,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:01:18,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:18,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:01:18,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:18,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:01:18,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:18,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:01:18,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:18,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:01:18,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:18,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:01:18,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:18,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:01:18,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:18,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:01:18,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:18,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:01:18,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:18,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:01:18,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:18,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 11:01:18,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:18,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 11:01:18,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:18,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 11:01:18,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:18,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 11:01:18,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:18,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 11:01:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:18,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 11:01:18,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:18,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 11:01:18,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:18,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 11:01:18,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:18,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 11:01:18,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:18,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-07 11:01:18,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:01:18,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211463882] [2024-11-07 11:01:18,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211463882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:01:18,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:01:18,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 11:01:18,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439964307] [2024-11-07 11:01:18,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:01:18,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 11:01:18,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:01:18,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 11:01:18,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 11:01:18,797 INFO L87 Difference]: Start difference. First operand 141 states and 204 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 11:01:19,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:01:19,116 INFO L93 Difference]: Finished difference Result 329 states and 476 transitions. [2024-11-07 11:01:19,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 11:01:19,117 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-07 11:01:19,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:01:19,118 INFO L225 Difference]: With dead ends: 329 [2024-11-07 11:01:19,118 INFO L226 Difference]: Without dead ends: 191 [2024-11-07 11:01:19,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 11:01:19,119 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 250 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 11:01:19,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 650 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 11:01:19,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-07 11:01:19,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 147. [2024-11-07 11:01:19,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 122 states have (on average 1.360655737704918) internal successors, (166), 122 states have internal predecessors, (166), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 11:01:19,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 212 transitions. [2024-11-07 11:01:19,131 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 212 transitions. Word has length 180 [2024-11-07 11:01:19,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:01:19,132 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 212 transitions. [2024-11-07 11:01:19,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 11:01:19,132 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 212 transitions. [2024-11-07 11:01:19,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-07 11:01:19,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:01:19,134 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:01:19,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 11:01:19,134 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:01:19,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:01:19,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1321908598, now seen corresponding path program 1 times [2024-11-07 11:01:19,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:01:19,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449590251] [2024-11-07 11:01:19,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:19,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:01:19,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:19,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:01:19,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:19,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:01:19,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:19,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:01:19,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:19,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:01:19,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:19,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:01:19,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:19,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:01:19,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:19,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:01:19,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:19,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:01:19,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:19,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:01:19,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:19,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:01:19,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:19,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:01:19,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:19,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:01:19,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:19,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:01:19,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:19,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:01:19,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:19,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 11:01:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:19,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 11:01:19,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:19,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 11:01:19,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:19,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 11:01:19,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:19,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 11:01:19,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:19,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 11:01:19,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:19,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 11:01:19,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:19,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 11:01:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:19,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 11:01:19,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:20,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-07 11:01:20,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:01:20,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449590251] [2024-11-07 11:01:20,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449590251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:01:20,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:01:20,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 11:01:20,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403223066] [2024-11-07 11:01:20,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:01:20,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 11:01:20,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:01:20,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 11:01:20,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 11:01:20,005 INFO L87 Difference]: Start difference. First operand 147 states and 212 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 11:01:20,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:01:20,476 INFO L93 Difference]: Finished difference Result 372 states and 538 transitions. [2024-11-07 11:01:20,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 11:01:20,477 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-07 11:01:20,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:01:20,478 INFO L225 Difference]: With dead ends: 372 [2024-11-07 11:01:20,478 INFO L226 Difference]: Without dead ends: 228 [2024-11-07 11:01:20,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-11-07 11:01:20,479 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 362 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 11:01:20,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 589 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 11:01:20,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-07 11:01:20,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 181. [2024-11-07 11:01:20,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 156 states have (on average 1.3782051282051282) internal successors, (215), 156 states have internal predecessors, (215), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 11:01:20,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 261 transitions. [2024-11-07 11:01:20,503 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 261 transitions. Word has length 180 [2024-11-07 11:01:20,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:01:20,503 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 261 transitions. [2024-11-07 11:01:20,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 11:01:20,503 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 261 transitions. [2024-11-07 11:01:20,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-07 11:01:20,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:01:20,504 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:01:20,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 11:01:20,505 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:01:20,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:01:20,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1630099825, now seen corresponding path program 1 times [2024-11-07 11:01:20,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:01:20,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372517314] [2024-11-07 11:01:20,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:20,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:01:20,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:22,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:01:22,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:22,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:01:22,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:22,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:01:22,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:22,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:01:22,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:22,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:01:22,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:22,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:01:22,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:22,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:01:22,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:22,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:01:22,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:22,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:01:22,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:22,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:01:22,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:22,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:01:22,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:22,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:01:22,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:22,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:01:22,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:22,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:01:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:22,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 11:01:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:22,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 11:01:22,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:22,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 11:01:22,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:22,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 11:01:22,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:22,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 11:01:22,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:22,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 11:01:22,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:22,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 11:01:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:22,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 11:01:22,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:22,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 11:01:22,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:22,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-07 11:01:22,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:01:22,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372517314] [2024-11-07 11:01:22,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372517314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:01:22,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:01:22,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-07 11:01:22,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315423855] [2024-11-07 11:01:22,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:01:22,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 11:01:22,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:01:22,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 11:01:22,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2024-11-07 11:01:22,542 INFO L87 Difference]: Start difference. First operand 181 states and 261 transitions. Second operand has 15 states, 14 states have (on average 4.857142857142857) internal successors, (68), 15 states have internal predecessors, (68), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-07 11:01:23,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:01:23,210 INFO L93 Difference]: Finished difference Result 404 states and 583 transitions. [2024-11-07 11:01:23,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 11:01:23,210 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.857142857142857) internal successors, (68), 15 states have internal predecessors, (68), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 180 [2024-11-07 11:01:23,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:01:23,212 INFO L225 Difference]: With dead ends: 404 [2024-11-07 11:01:23,212 INFO L226 Difference]: Without dead ends: 226 [2024-11-07 11:01:23,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2024-11-07 11:01:23,213 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 458 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 11:01:23,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 606 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 11:01:23,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-07 11:01:23,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 183. [2024-11-07 11:01:23,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 158 states have (on average 1.360759493670886) internal successors, (215), 158 states have internal predecessors, (215), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 11:01:23,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 261 transitions. [2024-11-07 11:01:23,228 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 261 transitions. Word has length 180 [2024-11-07 11:01:23,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:01:23,228 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 261 transitions. [2024-11-07 11:01:23,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.857142857142857) internal successors, (68), 15 states have internal predecessors, (68), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-07 11:01:23,229 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 261 transitions. [2024-11-07 11:01:23,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-07 11:01:23,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:01:23,230 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:01:23,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 11:01:23,230 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:01:23,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:01:23,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1049088925, now seen corresponding path program 1 times [2024-11-07 11:01:23,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:01:23,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275032029] [2024-11-07 11:01:23,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:23,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:01:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:23,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:01:23,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:23,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:01:23,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:23,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:01:23,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:23,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:01:23,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:23,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:01:23,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:23,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:01:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:23,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:01:23,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:23,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:01:23,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:23,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:01:23,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:23,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:01:23,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:23,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:01:23,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:23,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:01:23,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:23,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:01:23,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:23,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:01:23,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:23,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 11:01:23,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:23,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 11:01:23,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:23,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 11:01:23,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:23,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 11:01:23,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:23,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 11:01:23,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:23,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 11:01:23,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:23,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 11:01:23,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:23,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 11:01:23,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:23,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 11:01:23,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:23,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-07 11:01:23,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:01:23,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275032029] [2024-11-07 11:01:23,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275032029] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:01:23,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:01:23,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 11:01:23,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841717083] [2024-11-07 11:01:23,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:01:23,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 11:01:23,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:01:23,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 11:01:23,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 11:01:23,560 INFO L87 Difference]: Start difference. First operand 183 states and 261 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 11:01:23,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:01:23,867 INFO L93 Difference]: Finished difference Result 403 states and 576 transitions. [2024-11-07 11:01:23,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 11:01:23,869 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-07 11:01:23,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:01:23,870 INFO L225 Difference]: With dead ends: 403 [2024-11-07 11:01:23,870 INFO L226 Difference]: Without dead ends: 223 [2024-11-07 11:01:23,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-07 11:01:23,871 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 291 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 11:01:23,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 434 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 11:01:23,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-07 11:01:23,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 176. [2024-11-07 11:01:23,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 151 states have (on average 1.3576158940397351) internal successors, (205), 151 states have internal predecessors, (205), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 11:01:23,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 251 transitions. [2024-11-07 11:01:23,891 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 251 transitions. Word has length 180 [2024-11-07 11:01:23,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:01:23,892 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 251 transitions. [2024-11-07 11:01:23,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 11:01:23,892 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 251 transitions. [2024-11-07 11:01:23,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-07 11:01:23,893 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:01:23,894 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:01:23,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 11:01:23,894 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:01:23,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:01:23,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1370979444, now seen corresponding path program 1 times [2024-11-07 11:01:23,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:01:23,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957040307] [2024-11-07 11:01:23,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:23,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:01:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:24,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:01:24,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:24,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:01:24,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:24,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:01:24,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:24,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:01:24,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:24,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:01:24,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:24,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:01:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:24,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:01:24,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:24,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:01:24,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:24,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:01:24,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:24,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:01:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:24,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:01:24,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:24,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:01:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:24,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:01:24,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:24,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:01:24,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:24,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 11:01:24,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:24,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 11:01:24,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:24,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 11:01:24,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:24,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 11:01:24,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:24,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 11:01:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:24,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 11:01:24,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:24,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 11:01:24,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:24,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 11:01:24,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:24,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 11:01:24,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:24,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 9 proven. 57 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-07 11:01:24,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:01:24,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957040307] [2024-11-07 11:01:24,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957040307] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 11:01:24,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294288312] [2024-11-07 11:01:24,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:24,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 11:01:24,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 11:01:24,864 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 11:01:24,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 11:01:25,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:25,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-07 11:01:25,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 11:01:25,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 11:01:25,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-07 11:01:26,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-07 11:01:26,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-07 11:01:26,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-07 11:01:27,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-07 11:01:27,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-07 11:01:27,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-07 11:01:27,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-07 11:01:28,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-07 11:01:28,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:01:28,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-07 11:01:28,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:01:28,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-07 11:01:28,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 30 [2024-11-07 11:01:28,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:01:28,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 50 [2024-11-07 11:01:28,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:01:28,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:01:28,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2024-11-07 11:01:28,792 INFO L349 Elim1Store]: treesize reduction 32, result has 52.2 percent of original size [2024-11-07 11:01:28,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 137 treesize of output 135 [2024-11-07 11:01:28,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:01:31,902 INFO L349 Elim1Store]: treesize reduction 2390, result has 15.9 percent of original size [2024-11-07 11:01:31,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 8 stores, 11 select indices, 11 select index equivalence classes, 1 disjoint index pairs (out of 55 index pairs), introduced 19 new quantified variables, introduced 135 case distinctions, treesize of input 363 treesize of output 1053