./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-14.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-14.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', '0d45567a05c43a020d83c4148b7193297efc53c68aa1babb30080e6503f970de'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-14.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 0d45567a05c43a020d83c4148b7193297efc53c68aa1babb30080e6503f970de --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:28:09,788 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:28:09,882 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 08:28:09,890 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:28:09,890 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:28:09,918 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:28:09,919 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:28:09,920 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:28:09,921 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:28:09,921 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:28:09,922 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:28:09,922 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:28:09,922 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:28:09,923 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:28:09,923 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:28:09,923 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:28:09,923 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:28:09,923 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:28:09,923 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 08:28:09,924 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:28:09,924 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:28:09,924 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:28:09,924 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:28:09,924 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:28:09,924 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:28:09,924 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:28:09,924 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:28:09,925 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:28:09,925 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:28:09,925 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:28:09,925 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:28:09,925 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:28:09,926 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:28:09,926 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:28:09,926 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:28:09,926 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:28:09,926 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 08:28:09,926 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 08:28:09,927 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:28:09,927 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:28:09,927 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:28:09,927 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:28:09,928 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 -> 0d45567a05c43a020d83c4148b7193297efc53c68aa1babb30080e6503f970de [2024-11-07 08:28:10,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:28:10,241 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:28:10,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:28:10,245 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:28:10,246 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:28:10,247 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-14.i [2024-11-07 08:28:11,528 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:28:11,815 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:28:11,817 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-14.i [2024-11-07 08:28:11,831 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1d53aba57/62400e471701435cbe8289b7cb4ed13e/FLAG35fe065b2 [2024-11-07 08:28:11,849 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1d53aba57/62400e471701435cbe8289b7cb4ed13e [2024-11-07 08:28:11,853 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:28:11,854 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:28:11,857 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:28:11,857 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:28:11,861 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:28:11,862 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:28:11" (1/1) ... [2024-11-07 08:28:11,863 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d6caefa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:28:11, skipping insertion in model container [2024-11-07 08:28:11,865 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:28:11" (1/1) ... [2024-11-07 08:28:11,882 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:28:12,007 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-14.i[915,928] [2024-11-07 08:28:12,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:28:12,048 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:28:12,058 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-14.i[915,928] [2024-11-07 08:28:12,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:28:12,092 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:28:12,093 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:28:12 WrapperNode [2024-11-07 08:28:12,093 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:28:12,094 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:28:12,094 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:28:12,094 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:28:12,100 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:28:12" (1/1) ... [2024-11-07 08:28:12,106 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:28:12" (1/1) ... [2024-11-07 08:28:12,135 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2024-11-07 08:28:12,136 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:28:12,136 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:28:12,136 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:28:12,136 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:28:12,145 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:28:12" (1/1) ... [2024-11-07 08:28:12,146 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:28:12" (1/1) ... [2024-11-07 08:28:12,153 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:28:12" (1/1) ... [2024-11-07 08:28:12,174 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 08:28:12,177 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:28:12" (1/1) ... [2024-11-07 08:28:12,178 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:28:12" (1/1) ... [2024-11-07 08:28:12,183 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:28:12" (1/1) ... [2024-11-07 08:28:12,187 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:28:12" (1/1) ... [2024-11-07 08:28:12,192 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:28:12" (1/1) ... [2024-11-07 08:28:12,193 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:28:12" (1/1) ... [2024-11-07 08:28:12,203 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:28:12,204 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:28:12,204 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:28:12,204 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:28:12,205 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:28:12" (1/1) ... [2024-11-07 08:28:12,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:28:12,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:28:12,238 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 08:28:12,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 08:28:12,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:28:12,265 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:28:12,266 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:28:12,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 08:28:12,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:28:12,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:28:12,336 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:28:12,338 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:28:12,558 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-07 08:28:12,558 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:28:12,567 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:28:12,568 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:28:12,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:28:12 BoogieIcfgContainer [2024-11-07 08:28:12,568 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:28:12,571 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:28:12,571 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:28:12,575 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:28:12,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:28:11" (1/3) ... [2024-11-07 08:28:12,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@133e67e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:28:12, skipping insertion in model container [2024-11-07 08:28:12,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:28:12" (2/3) ... [2024-11-07 08:28:12,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@133e67e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:28:12, skipping insertion in model container [2024-11-07 08:28:12,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:28:12" (3/3) ... [2024-11-07 08:28:12,577 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-14.i [2024-11-07 08:28:12,591 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:28:12,591 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:28:12,642 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:28:12,651 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;@21651901, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:28:12,651 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:28:12,656 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 08:28:12,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 08:28:12,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:28:12,665 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:28:12,665 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:28:12,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:28:12,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1173987694, now seen corresponding path program 1 times [2024-11-07 08:28:12,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:28:12,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704161983] [2024-11-07 08:28:12,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:28:12,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:28:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:12,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:28:12,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:12,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:28:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:12,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:28:12,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:12,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:28:12,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:12,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:28:12,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:12,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:28:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:12,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:28:12,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:12,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:28:12,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:12,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:28:12,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:12,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:28:12,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:12,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:28:12,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:12,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:28:12,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:12,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:28:13,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:13,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:28:13,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:13,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:28:13,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:13,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:28:13,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:13,026 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 08:28:13,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:28:13,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704161983] [2024-11-07 08:28:13,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704161983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:28:13,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:28:13,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:28:13,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392946588] [2024-11-07 08:28:13,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:28:13,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:28:13,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:28:13,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:28:13,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:28:13,059 INFO L87 Difference]: Start difference. First operand has 51 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 08:28:13,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:28:13,086 INFO L93 Difference]: Finished difference Result 95 states and 158 transitions. [2024-11-07 08:28:13,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:28:13,088 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 104 [2024-11-07 08:28:13,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:28:13,092 INFO L225 Difference]: With dead ends: 95 [2024-11-07 08:28:13,092 INFO L226 Difference]: Without dead ends: 47 [2024-11-07 08:28:13,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:28:13,097 INFO L432 NwaCegarLoop]: 67 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, 67 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:28:13,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:28:13,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-07 08:28:13,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-07 08:28:13,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 08:28:13,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 67 transitions. [2024-11-07 08:28:13,140 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 67 transitions. Word has length 104 [2024-11-07 08:28:13,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:28:13,141 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 67 transitions. [2024-11-07 08:28:13,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 08:28:13,142 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 67 transitions. [2024-11-07 08:28:13,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 08:28:13,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:28:13,144 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:28:13,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 08:28:13,145 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:28:13,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:28:13,145 INFO L85 PathProgramCache]: Analyzing trace with hash -807059822, now seen corresponding path program 1 times [2024-11-07 08:28:13,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:28:13,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66069150] [2024-11-07 08:28:13,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:28:13,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:28:13,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:13,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:28:13,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:13,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:28:13,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:13,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:28:13,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:13,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:28:13,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:13,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:28:13,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:13,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:28:13,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:13,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:28:13,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:13,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:28:13,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:13,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:28:13,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:13,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:28:13,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:13,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:28:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:13,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:28:13,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:13,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:28:13,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:13,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:28:13,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:13,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:28:13,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:13,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:28:13,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:13,702 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 08:28:13,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:28:13,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66069150] [2024-11-07 08:28:13,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66069150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:28:13,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:28:13,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 08:28:13,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505417724] [2024-11-07 08:28:13,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:28:13,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 08:28:13,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:28:13,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 08:28:13,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 08:28:13,708 INFO L87 Difference]: Start difference. First operand 47 states and 67 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 08:28:13,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:28:13,869 INFO L93 Difference]: Finished difference Result 146 states and 208 transitions. [2024-11-07 08:28:13,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 08:28:13,870 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 104 [2024-11-07 08:28:13,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:28:13,871 INFO L225 Difference]: With dead ends: 146 [2024-11-07 08:28:13,872 INFO L226 Difference]: Without dead ends: 102 [2024-11-07 08:28:13,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:28:13,873 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 63 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 08:28:13,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 180 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 08:28:13,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-07 08:28:13,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 89. [2024-11-07 08:28:13,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 54 states have internal predecessors, (64), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 08:28:13,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 128 transitions. [2024-11-07 08:28:13,908 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 128 transitions. Word has length 104 [2024-11-07 08:28:13,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:28:13,910 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 128 transitions. [2024-11-07 08:28:13,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 08:28:13,910 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 128 transitions. [2024-11-07 08:28:13,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 08:28:13,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:28:13,913 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:28:13,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 08:28:13,913 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:28:13,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:28:13,914 INFO L85 PathProgramCache]: Analyzing trace with hash -105995244, now seen corresponding path program 1 times [2024-11-07 08:28:13,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:28:13,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814122761] [2024-11-07 08:28:13,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:28:13,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:28:14,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:17,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:28:17,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:17,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:28:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:17,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:28:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:17,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:28:17,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:17,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:28:17,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:17,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:28:17,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:17,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:28:17,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:17,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:28:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:17,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:28:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:17,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:28:17,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:17,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:28:17,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:17,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:28:17,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:17,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:28:17,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:17,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:28:17,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:17,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:28:17,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:17,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:28:17,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:17,997 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 08:28:17,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:28:17,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814122761] [2024-11-07 08:28:17,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814122761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:28:17,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:28:18,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 08:28:18,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589682017] [2024-11-07 08:28:18,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:28:18,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 08:28:18,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:28:18,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 08:28:18,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-07 08:28:18,002 INFO L87 Difference]: Start difference. First operand 89 states and 128 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 08:28:18,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:28:18,761 INFO L93 Difference]: Finished difference Result 99 states and 137 transitions. [2024-11-07 08:28:18,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 08:28:18,761 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 104 [2024-11-07 08:28:18,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:28:18,765 INFO L225 Difference]: With dead ends: 99 [2024-11-07 08:28:18,766 INFO L226 Difference]: Without dead ends: 97 [2024-11-07 08:28:18,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2024-11-07 08:28:18,767 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 73 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 08:28:18,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 251 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 08:28:18,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-07 08:28:18,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 92. [2024-11-07 08:28:18,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 57 states have internal predecessors, (67), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 08:28:18,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 131 transitions. [2024-11-07 08:28:18,792 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 131 transitions. Word has length 104 [2024-11-07 08:28:18,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:28:18,792 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 131 transitions. [2024-11-07 08:28:18,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 08:28:18,793 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 131 transitions. [2024-11-07 08:28:18,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 08:28:18,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:28:18,795 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:28:18,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 08:28:18,795 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:28:18,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:28:18,796 INFO L85 PathProgramCache]: Analyzing trace with hash -104148202, now seen corresponding path program 1 times [2024-11-07 08:28:18,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:28:18,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484015581] [2024-11-07 08:28:18,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:28:18,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:28:18,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:18,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:28:18,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:18,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:28:18,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:18,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:28:18,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:18,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:28:18,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:18,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:28:18,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:18,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:28:18,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:18,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:28:18,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:18,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:28:18,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:18,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:28:18,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:18,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:28:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:18,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:28:18,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:18,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:28:18,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:18,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:28:18,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:18,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:28:18,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:18,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:28:18,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:18,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:28:18,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:18,961 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 08:28:18,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:28:18,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484015581] [2024-11-07 08:28:18,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484015581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:28:18,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:28:18,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 08:28:18,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866379351] [2024-11-07 08:28:18,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:28:18,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 08:28:18,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:28:18,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 08:28:18,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:28:18,963 INFO L87 Difference]: Start difference. First operand 92 states and 131 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 08:28:19,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:28:19,090 INFO L93 Difference]: Finished difference Result 222 states and 319 transitions. [2024-11-07 08:28:19,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 08:28:19,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 104 [2024-11-07 08:28:19,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:28:19,093 INFO L225 Difference]: With dead ends: 222 [2024-11-07 08:28:19,093 INFO L226 Difference]: Without dead ends: 133 [2024-11-07 08:28:19,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 08:28:19,094 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 47 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 08:28:19,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 211 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 08:28:19,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-07 08:28:19,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2024-11-07 08:28:19,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 79 states have (on average 1.1645569620253164) internal successors, (92), 79 states have internal predecessors, (92), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 08:28:19,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 188 transitions. [2024-11-07 08:28:19,120 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 188 transitions. Word has length 104 [2024-11-07 08:28:19,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:28:19,120 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 188 transitions. [2024-11-07 08:28:19,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 08:28:19,122 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 188 transitions. [2024-11-07 08:28:19,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-07 08:28:19,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:28:19,123 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:28:19,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 08:28:19,123 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:28:19,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:28:19,126 INFO L85 PathProgramCache]: Analyzing trace with hash 359733697, now seen corresponding path program 1 times [2024-11-07 08:28:19,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:28:19,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576877879] [2024-11-07 08:28:19,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:28:19,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:28:19,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:22,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:28:22,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:22,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:28:22,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:22,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:28:22,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:22,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:28:22,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:22,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:28:22,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:22,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:28:22,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:22,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:28:22,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:22,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:28:22,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:22,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:28:22,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:22,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:28:22,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:22,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:28:22,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:22,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:28:22,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:22,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:28:22,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:22,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:28:22,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:22,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:28:22,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:22,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:28:22,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:22,628 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 08:28:22,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:28:22,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576877879] [2024-11-07 08:28:22,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576877879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:28:22,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:28:22,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 08:28:22,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759196141] [2024-11-07 08:28:22,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:28:22,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 08:28:22,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:28:22,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 08:28:22,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-07 08:28:22,632 INFO L87 Difference]: Start difference. First operand 131 states and 188 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 08:28:23,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:28:23,925 INFO L93 Difference]: Finished difference Result 165 states and 223 transitions. [2024-11-07 08:28:23,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 08:28:23,926 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2024-11-07 08:28:23,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:28:23,929 INFO L225 Difference]: With dead ends: 165 [2024-11-07 08:28:23,929 INFO L226 Difference]: Without dead ends: 163 [2024-11-07 08:28:23,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-07 08:28:23,930 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 64 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 08:28:23,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 392 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 08:28:23,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-07 08:28:23,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 138. [2024-11-07 08:28:23,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 86 states have (on average 1.1627906976744187) internal successors, (100), 86 states have internal predecessors, (100), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 08:28:23,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 196 transitions. [2024-11-07 08:28:23,961 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 196 transitions. Word has length 105 [2024-11-07 08:28:23,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:28:23,963 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 196 transitions. [2024-11-07 08:28:23,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 08:28:23,964 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 196 transitions. [2024-11-07 08:28:23,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-07 08:28:23,965 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:28:23,965 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:28:23,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 08:28:23,967 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:28:23,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:28:23,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1415273665, now seen corresponding path program 1 times [2024-11-07 08:28:23,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:28:23,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257041211] [2024-11-07 08:28:23,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:28:23,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:28:24,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:26,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:28:26,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:26,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:28:26,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:26,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:28:26,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:26,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:28:26,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:26,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:28:26,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:26,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:28:26,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:26,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:28:26,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:26,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:28:26,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:26,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:28:26,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:26,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:28:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:26,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:28:26,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:26,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:28:26,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:26,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:28:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:26,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:28:26,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:26,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:28:26,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:26,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:28:26,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:26,610 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 08:28:26,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:28:26,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257041211] [2024-11-07 08:28:26,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257041211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:28:26,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:28:26,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 08:28:26,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468696409] [2024-11-07 08:28:26,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:28:26,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 08:28:26,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:28:26,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 08:28:26,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-07 08:28:26,612 INFO L87 Difference]: Start difference. First operand 138 states and 196 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 08:28:27,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:28:27,183 INFO L93 Difference]: Finished difference Result 161 states and 222 transitions. [2024-11-07 08:28:27,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 08:28:27,184 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2024-11-07 08:28:27,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:28:27,186 INFO L225 Difference]: With dead ends: 161 [2024-11-07 08:28:27,186 INFO L226 Difference]: Without dead ends: 159 [2024-11-07 08:28:27,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-07 08:28:27,187 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 38 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 08:28:27,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 319 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 08:28:27,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-07 08:28:27,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 145. [2024-11-07 08:28:27,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 93 states have (on average 1.1720430107526882) internal successors, (109), 93 states have internal predecessors, (109), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 08:28:27,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 205 transitions. [2024-11-07 08:28:27,202 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 205 transitions. Word has length 105 [2024-11-07 08:28:27,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:28:27,202 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 205 transitions. [2024-11-07 08:28:27,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 08:28:27,203 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 205 transitions. [2024-11-07 08:28:27,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-07 08:28:27,205 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:28:27,205 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:28:27,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 08:28:27,206 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:28:27,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:28:27,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1660332687, now seen corresponding path program 1 times [2024-11-07 08:28:27,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:28:27,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709109252] [2024-11-07 08:28:27,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:28:27,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:28:27,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:27,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:28:27,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:27,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:28:27,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:27,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:28:27,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:27,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:28:27,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:27,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:28:27,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:27,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:28:27,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:27,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:28:27,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:27,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:28:27,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:27,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:28:27,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:27,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:28:27,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:27,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:28:27,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:27,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:28:27,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:27,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:28:27,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:27,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:28:27,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:27,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:28:27,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:27,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:28:27,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:27,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 08:28:27,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:27,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 08:28:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:27,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 08:28:27,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:27,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 08:28:27,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:27,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 08:28:27,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:27,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 08:28:27,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:27,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-07 08:28:27,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:27,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-07 08:28:27,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:27,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-07 08:28:27,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:27,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 08:28:27,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:27,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-07 08:28:27,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:27,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-07 08:28:27,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:27,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-07 08:28:27,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:27,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-07 08:28:27,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:27,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-07 08:28:27,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:27,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-07 08:28:27,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:27,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2020 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 08:28:27,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:28:27,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709109252] [2024-11-07 08:28:27,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709109252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:28:27,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:28:27,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 08:28:27,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023124900] [2024-11-07 08:28:27,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:28:27,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 08:28:27,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:28:27,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 08:28:27,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 08:28:27,714 INFO L87 Difference]: Start difference. First operand 145 states and 205 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 08:28:28,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:28:28,018 INFO L93 Difference]: Finished difference Result 391 states and 542 transitions. [2024-11-07 08:28:28,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 08:28:28,019 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 206 [2024-11-07 08:28:28,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:28:28,022 INFO L225 Difference]: With dead ends: 391 [2024-11-07 08:28:28,022 INFO L226 Difference]: Without dead ends: 291 [2024-11-07 08:28:28,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-07 08:28:28,023 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 156 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 08:28:28,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 253 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 08:28:28,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-07 08:28:28,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 251. [2024-11-07 08:28:28,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 154 states have (on average 1.12987012987013) internal successors, (174), 158 states have internal predecessors, (174), 88 states have call successors, (88), 8 states have call predecessors, (88), 8 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-07 08:28:28,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 350 transitions. [2024-11-07 08:28:28,077 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 350 transitions. Word has length 206 [2024-11-07 08:28:28,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:28:28,077 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 350 transitions. [2024-11-07 08:28:28,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 08:28:28,078 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 350 transitions. [2024-11-07 08:28:28,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-07 08:28:28,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:28:28,081 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:28:28,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 08:28:28,081 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:28:28,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:28:28,081 INFO L85 PathProgramCache]: Analyzing trace with hash -959268109, now seen corresponding path program 1 times [2024-11-07 08:28:28,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:28:28,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930441984] [2024-11-07 08:28:28,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:28:28,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:28:28,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:31,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:28:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:31,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:28:31,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:31,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:28:31,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:31,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:28:31,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:31,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:28:31,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:31,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:28:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:31,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:28:31,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:31,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:28:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:31,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:28:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:31,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:28:31,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:31,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:28:31,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:31,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:28:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:31,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:28:31,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:31,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:28:31,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:31,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:28:31,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:31,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:28:31,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:31,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 08:28:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:31,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 08:28:31,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:31,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 08:28:31,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:31,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 08:28:31,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:31,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 08:28:31,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:31,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 08:28:31,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:31,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-07 08:28:31,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:31,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-07 08:28:31,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:31,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-07 08:28:31,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:31,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 08:28:31,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:31,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-07 08:28:31,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:31,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-07 08:28:31,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:31,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-07 08:28:31,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:31,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-07 08:28:31,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:31,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-07 08:28:31,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:31,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-07 08:28:31,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:31,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2020 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 08:28:31,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:28:31,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930441984] [2024-11-07 08:28:31,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930441984] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:28:31,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711934179] [2024-11-07 08:28:31,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:28:31,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:28:31,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:28:31,170 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 08:28:31,172 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 08:28:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:31,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-07 08:28:31,349 INFO L278 TraceCheckSpWp]: Computing forward predicates...