./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-9.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', 'afbe11d6255891eb62142fb858f033cde06ed708dce6d7f48966c5c7a69497ae'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-9.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 afbe11d6255891eb62142fb858f033cde06ed708dce6d7f48966c5c7a69497ae --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 05:00:49,953 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 05:00:50,043 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 05:00:50,051 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 05:00:50,053 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 05:00:50,082 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 05:00:50,082 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 05:00:50,082 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 05:00:50,083 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 05:00:50,083 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 05:00:50,083 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 05:00:50,083 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 05:00:50,084 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 05:00:50,084 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 05:00:50,085 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 05:00:50,085 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 05:00:50,085 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 05:00:50,085 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 05:00:50,085 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 05:00:50,085 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 05:00:50,085 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 05:00:50,086 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 05:00:50,086 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 05:00:50,086 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 05:00:50,086 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 05:00:50,086 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 05:00:50,086 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 05:00:50,086 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 05:00:50,087 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 05:00:50,087 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 05:00:50,087 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 05:00:50,087 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 05:00:50,087 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:00:50,087 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 05:00:50,087 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 05:00:50,088 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 05:00:50,088 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 05:00:50,088 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 05:00:50,088 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 05:00:50,088 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 05:00:50,088 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 05:00:50,088 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 05:00:50,088 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 -> afbe11d6255891eb62142fb858f033cde06ed708dce6d7f48966c5c7a69497ae [2024-11-07 05:00:50,399 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 05:00:50,410 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 05:00:50,413 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 05:00:50,414 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 05:00:50,414 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 05:00:50,415 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-9.i [2024-11-07 05:00:51,749 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 05:00:52,001 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 05:00:52,001 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-9.i [2024-11-07 05:00:52,013 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9ee7fc94e/b88754a43c0949db87241bc324b82cdf/FLAGd829405b5 [2024-11-07 05:00:52,045 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9ee7fc94e/b88754a43c0949db87241bc324b82cdf [2024-11-07 05:00:52,055 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 05:00:52,060 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 05:00:52,062 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 05:00:52,062 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 05:00:52,067 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 05:00:52,069 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:00:52" (1/1) ... [2024-11-07 05:00:52,070 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f631e99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:00:52, skipping insertion in model container [2024-11-07 05:00:52,070 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:00:52" (1/1) ... [2024-11-07 05:00:52,093 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 05:00:52,244 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-9.i[914,927] [2024-11-07 05:00:52,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:00:52,348 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 05:00:52,360 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-9.i[914,927] [2024-11-07 05:00:52,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:00:52,425 INFO L204 MainTranslator]: Completed translation [2024-11-07 05:00:52,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:00:52 WrapperNode [2024-11-07 05:00:52,427 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 05:00:52,428 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 05:00:52,428 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 05:00:52,429 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 05:00:52,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:00:52" (1/1) ... [2024-11-07 05:00:52,448 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:00:52" (1/1) ... [2024-11-07 05:00:52,490 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 227 [2024-11-07 05:00:52,491 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 05:00:52,491 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 05:00:52,491 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 05:00:52,492 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 05:00:52,500 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:00:52" (1/1) ... [2024-11-07 05:00:52,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:00:52" (1/1) ... [2024-11-07 05:00:52,504 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:00:52" (1/1) ... [2024-11-07 05:00:52,524 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 05:00:52,524 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:00:52" (1/1) ... [2024-11-07 05:00:52,524 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:00:52" (1/1) ... [2024-11-07 05:00:52,535 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:00:52" (1/1) ... [2024-11-07 05:00:52,539 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:00:52" (1/1) ... [2024-11-07 05:00:52,547 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:00:52" (1/1) ... [2024-11-07 05:00:52,549 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:00:52" (1/1) ... [2024-11-07 05:00:52,554 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 05:00:52,557 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 05:00:52,558 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 05:00:52,558 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 05:00:52,560 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:00:52" (1/1) ... [2024-11-07 05:00:52,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:00:52,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:00:52,596 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 05:00:52,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 05:00:52,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 05:00:52,624 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 05:00:52,626 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 05:00:52,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 05:00:52,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 05:00:52,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 05:00:52,733 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 05:00:52,736 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 05:00:53,175 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-07 05:00:53,176 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 05:00:53,190 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 05:00:53,192 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 05:00:53,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:00:53 BoogieIcfgContainer [2024-11-07 05:00:53,192 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 05:00:53,195 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 05:00:53,195 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 05:00:53,201 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 05:00:53,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:00:52" (1/3) ... [2024-11-07 05:00:53,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@662e30b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:00:53, skipping insertion in model container [2024-11-07 05:00:53,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:00:52" (2/3) ... [2024-11-07 05:00:53,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@662e30b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:00:53, skipping insertion in model container [2024-11-07 05:00:53,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:00:53" (3/3) ... [2024-11-07 05:00:53,204 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-9.i [2024-11-07 05:00:53,217 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 05:00:53,218 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 05:00:53,302 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 05:00:53,314 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;@4fc5acb9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 05:00:53,314 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 05:00:53,320 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 64 states have (on average 1.375) internal successors, (88), 65 states have internal predecessors, (88), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 05:00:53,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-07 05:00:53,334 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:00:53,334 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:00:53,335 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:00:53,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:00:53,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1627320500, now seen corresponding path program 1 times [2024-11-07 05:00:53,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:00:53,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993666816] [2024-11-07 05:00:53,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:00:53,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:00:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:53,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:00:53,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:53,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:00:53,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:53,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:00:53,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:53,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:00:53,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:53,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 05:00:53,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:53,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:00:53,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:53,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:00:53,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:53,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:00:53,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:53,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 05:00:53,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:53,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:00:53,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:53,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:00:53,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:53,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:00:53,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:53,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:00:53,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:53,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 05:00:53,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:53,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:00:53,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:53,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 05:00:53,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:53,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:00:53,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:53,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:00:53,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:53,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:00:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:53,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 05:00:53,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:53,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 05:00:53,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:53,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 05:00:53,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:53,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 05:00:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:53,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 05:00:53,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:53,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 05:00:53,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:53,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 05:00:53,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:53,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-07 05:00:53,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:00:53,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993666816] [2024-11-07 05:00:53,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993666816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:00:53,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:00:53,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 05:00:53,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062105690] [2024-11-07 05:00:53,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:00:53,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 05:00:53,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:00:53,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 05:00:53,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 05:00:53,849 INFO L87 Difference]: Start difference. First operand has 93 states, 64 states have (on average 1.375) internal successors, (88), 65 states have internal predecessors, (88), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-07 05:00:53,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:00:53,885 INFO L93 Difference]: Finished difference Result 179 states and 300 transitions. [2024-11-07 05:00:53,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 05:00:53,887 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 171 [2024-11-07 05:00:53,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:00:53,893 INFO L225 Difference]: With dead ends: 179 [2024-11-07 05:00:53,893 INFO L226 Difference]: Without dead ends: 89 [2024-11-07 05:00:53,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 05:00:53,899 INFO L432 NwaCegarLoop]: 133 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, 133 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 05:00:53,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:00:53,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-07 05:00:53,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-07 05:00:53,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 61 states have internal predecessors, (81), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 05:00:53,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 133 transitions. [2024-11-07 05:00:53,950 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 133 transitions. Word has length 171 [2024-11-07 05:00:53,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:00:53,952 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 133 transitions. [2024-11-07 05:00:53,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-07 05:00:53,952 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 133 transitions. [2024-11-07 05:00:53,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-07 05:00:53,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:00:53,957 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:00:53,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 05:00:53,957 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:00:53,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:00:53,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1363168124, now seen corresponding path program 1 times [2024-11-07 05:00:53,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:00:53,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81503769] [2024-11-07 05:00:53,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:00:53,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:00:54,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:54,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:00:54,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:54,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:00:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:54,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:00:54,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:54,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:00:54,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:54,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 05:00:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:54,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:00:54,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:54,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:00:54,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:54,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:00:54,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:54,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 05:00:54,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:54,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:00:54,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:54,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:00:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:54,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:00:54,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:54,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:00:54,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:54,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 05:00:54,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:54,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:00:54,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:54,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 05:00:54,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:54,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:00:54,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:54,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:00:54,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:54,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:00:54,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:54,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 05:00:54,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:54,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 05:00:54,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:54,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 05:00:54,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:54,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 05:00:54,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:54,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 05:00:54,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:54,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 05:00:54,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:54,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 05:00:54,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:54,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-07 05:00:54,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:00:54,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81503769] [2024-11-07 05:00:54,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81503769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:00:54,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:00:54,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:00:54,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730193642] [2024-11-07 05:00:54,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:00:54,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 05:00:54,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:00:54,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 05:00:54,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:00:54,485 INFO L87 Difference]: Start difference. First operand 89 states and 133 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 05:00:54,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:00:54,523 INFO L93 Difference]: Finished difference Result 176 states and 265 transitions. [2024-11-07 05:00:54,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:00:54,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2024-11-07 05:00:54,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:00:54,529 INFO L225 Difference]: With dead ends: 176 [2024-11-07 05:00:54,529 INFO L226 Difference]: Without dead ends: 90 [2024-11-07 05:00:54,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:00:54,531 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 05:00:54,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 259 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:00:54,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-07 05:00:54,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-07 05:00:54,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 62 states have internal predecessors, (82), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 05:00:54,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 134 transitions. [2024-11-07 05:00:54,554 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 134 transitions. Word has length 171 [2024-11-07 05:00:54,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:00:54,560 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 134 transitions. [2024-11-07 05:00:54,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 05:00:54,560 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 134 transitions. [2024-11-07 05:00:54,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-07 05:00:54,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:00:54,563 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:00:54,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 05:00:54,565 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:00:54,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:00:54,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1998716338, now seen corresponding path program 1 times [2024-11-07 05:00:54,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:00:54,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398267012] [2024-11-07 05:00:54,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:00:54,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:00:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:58,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:00:58,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:58,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:00:58,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:58,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:00:58,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:58,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:00:58,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:58,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 05:00:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:58,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:00:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:58,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:00:58,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:58,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:00:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:58,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 05:00:58,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:58,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:00:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:58,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:00:58,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:58,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:00:58,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:58,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:00:58,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:58,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 05:00:58,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:58,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:00:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:58,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 05:00:58,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:58,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:00:58,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:58,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:00:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:58,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:00:58,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:58,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 05:00:58,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:58,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 05:00:58,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:58,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 05:00:58,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:58,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 05:00:58,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:58,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 05:00:58,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:58,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 05:00:58,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:58,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 05:00:58,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:00:58,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-07 05:00:58,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:00:58,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398267012] [2024-11-07 05:00:58,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398267012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:00:58,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:00:58,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 05:00:58,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089231168] [2024-11-07 05:00:58,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:00:58,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 05:00:58,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:00:58,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 05:00:58,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-07 05:00:58,095 INFO L87 Difference]: Start difference. First operand 90 states and 134 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 05:00:58,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:00:58,672 INFO L93 Difference]: Finished difference Result 244 states and 358 transitions. [2024-11-07 05:00:58,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 05:00:58,673 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2024-11-07 05:00:58,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:00:58,677 INFO L225 Difference]: With dead ends: 244 [2024-11-07 05:00:58,677 INFO L226 Difference]: Without dead ends: 157 [2024-11-07 05:00:58,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-07 05:00:58,679 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 181 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 05:00:58,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 379 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 05:00:58,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-07 05:00:58,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 114. [2024-11-07 05:00:58,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 86 states have (on average 1.3837209302325582) internal successors, (119), 86 states have internal predecessors, (119), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 05:00:58,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 171 transitions. [2024-11-07 05:00:58,699 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 171 transitions. Word has length 172 [2024-11-07 05:00:58,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:00:58,700 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 171 transitions. [2024-11-07 05:00:58,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 05:00:58,700 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 171 transitions. [2024-11-07 05:00:58,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-07 05:00:58,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:00:58,706 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:00:58,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 05:00:58,706 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:00:58,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:00:58,707 INFO L85 PathProgramCache]: Analyzing trace with hash 607307216, now seen corresponding path program 1 times [2024-11-07 05:00:58,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:00:58,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603215655] [2024-11-07 05:00:58,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:00:58,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:00:58,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:00,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:01:00,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:00,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:01:00,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:00,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:01:00,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:00,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:01:00,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:00,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 05:01:00,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:00,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:01:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:00,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:01:00,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:00,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:01:00,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:00,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 05:01:00,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:00,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:01:00,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:00,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:01:00,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:00,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:01:00,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:00,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:01:00,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:00,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 05:01:00,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:00,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:01:00,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:00,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 05:01:00,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:00,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:01:00,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:00,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:01:00,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:00,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:01:00,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:00,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 05:01:00,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:00,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 05:01:00,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:00,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 05:01:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:00,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 05:01:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:00,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 05:01:00,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:00,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 05:01:00,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:00,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 05:01:00,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:00,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-07 05:01:00,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:01:00,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603215655] [2024-11-07 05:01:00,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603215655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:01:00,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:01:00,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 05:01:00,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112495519] [2024-11-07 05:01:00,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:01:00,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 05:01:00,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:01:00,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 05:01:00,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 05:01:00,929 INFO L87 Difference]: Start difference. First operand 114 states and 171 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 05:01:02,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:01:02,371 INFO L93 Difference]: Finished difference Result 317 states and 471 transitions. [2024-11-07 05:01:02,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 05:01:02,374 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2024-11-07 05:01:02,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:01:02,377 INFO L225 Difference]: With dead ends: 317 [2024-11-07 05:01:02,377 INFO L226 Difference]: Without dead ends: 206 [2024-11-07 05:01:02,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-07 05:01:02,379 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 93 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 05:01:02,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 716 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 05:01:02,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-07 05:01:02,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 126. [2024-11-07 05:01:02,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 98 states have (on average 1.4183673469387754) internal successors, (139), 98 states have internal predecessors, (139), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 05:01:02,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 191 transitions. [2024-11-07 05:01:02,400 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 191 transitions. Word has length 172 [2024-11-07 05:01:02,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:01:02,401 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 191 transitions. [2024-11-07 05:01:02,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 05:01:02,401 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 191 transitions. [2024-11-07 05:01:02,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-07 05:01:02,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:01:02,405 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:01:02,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 05:01:02,405 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:01:02,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:01:02,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1030009042, now seen corresponding path program 1 times [2024-11-07 05:01:02,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:01:02,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000519380] [2024-11-07 05:01:02,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:01:02,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:01:02,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:03,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:01:03,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:03,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:01:03,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:03,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:01:03,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:03,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:01:03,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:03,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 05:01:03,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:03,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:01:03,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:03,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:01:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:03,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:01:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:03,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 05:01:03,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:03,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:01:03,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:03,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:01:03,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:03,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:01:03,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:03,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:01:03,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:03,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 05:01:03,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:03,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:01:03,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:03,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 05:01:03,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:03,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:01:03,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:03,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:01:03,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:03,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:01:03,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:03,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 05:01:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:03,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 05:01:03,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:03,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 05:01:03,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:03,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 05:01:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:03,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 05:01:03,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:03,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 05:01:03,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:03,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 05:01:03,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:03,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-07 05:01:03,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:01:03,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000519380] [2024-11-07 05:01:03,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000519380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:01:03,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:01:03,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 05:01:03,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768444682] [2024-11-07 05:01:03,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:01:03,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 05:01:03,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:01:03,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 05:01:03,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 05:01:03,335 INFO L87 Difference]: Start difference. First operand 126 states and 191 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 05:01:03,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:01:03,769 INFO L93 Difference]: Finished difference Result 329 states and 491 transitions. [2024-11-07 05:01:03,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 05:01:03,770 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2024-11-07 05:01:03,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:01:03,772 INFO L225 Difference]: With dead ends: 329 [2024-11-07 05:01:03,772 INFO L226 Difference]: Without dead ends: 206 [2024-11-07 05:01:03,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-07 05:01:03,774 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 93 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 05:01:03,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 622 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 05:01:03,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-07 05:01:03,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 114. [2024-11-07 05:01:03,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 86 states have (on average 1.3837209302325582) internal successors, (119), 86 states have internal predecessors, (119), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 05:01:03,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 171 transitions. [2024-11-07 05:01:03,787 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 171 transitions. Word has length 172 [2024-11-07 05:01:03,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:01:03,787 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 171 transitions. [2024-11-07 05:01:03,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 05:01:03,787 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 171 transitions. [2024-11-07 05:01:03,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-07 05:01:03,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:01:03,790 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:01:03,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 05:01:03,790 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:01:03,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:01:03,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1360632018, now seen corresponding path program 1 times [2024-11-07 05:01:03,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:01:03,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796333218] [2024-11-07 05:01:03,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:01:03,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:01:03,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:05,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:01:05,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:05,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:01:05,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:05,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:01:05,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:05,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:01:05,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:05,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 05:01:05,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:05,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:01:05,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:05,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:01:05,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:05,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:01:05,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:05,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 05:01:05,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:05,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:01:05,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:05,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:01:05,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:05,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:01:05,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:05,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:01:05,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:05,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 05:01:05,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:05,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:01:05,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:05,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 05:01:05,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:05,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:01:05,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:05,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:01:05,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:05,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:01:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:05,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 05:01:05,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:05,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 05:01:05,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:05,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 05:01:05,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:05,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 05:01:05,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:05,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 05:01:05,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:05,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 05:01:05,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:05,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 05:01:05,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:05,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-07 05:01:05,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:01:05,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796333218] [2024-11-07 05:01:05,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796333218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:01:05,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:01:05,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 05:01:05,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599260201] [2024-11-07 05:01:05,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:01:05,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 05:01:05,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:01:05,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 05:01:05,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 05:01:05,639 INFO L87 Difference]: Start difference. First operand 114 states and 171 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 05:01:06,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:01:06,013 INFO L93 Difference]: Finished difference Result 257 states and 381 transitions. [2024-11-07 05:01:06,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 05:01:06,014 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2024-11-07 05:01:06,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:01:06,016 INFO L225 Difference]: With dead ends: 257 [2024-11-07 05:01:06,016 INFO L226 Difference]: Without dead ends: 146 [2024-11-07 05:01:06,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-07 05:01:06,017 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 130 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 05:01:06,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 425 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 05:01:06,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-07 05:01:06,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 92. [2024-11-07 05:01:06,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 64 states have (on average 1.3125) internal successors, (84), 64 states have internal predecessors, (84), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 05:01:06,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 136 transitions. [2024-11-07 05:01:06,026 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 136 transitions. Word has length 173 [2024-11-07 05:01:06,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:01:06,026 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 136 transitions. [2024-11-07 05:01:06,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 05:01:06,027 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 136 transitions. [2024-11-07 05:01:06,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-07 05:01:06,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:01:06,028 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:01:06,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 05:01:06,029 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:01:06,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:01:06,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1464472855, now seen corresponding path program 1 times [2024-11-07 05:01:06,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:01:06,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857792752] [2024-11-07 05:01:06,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:01:06,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:01:06,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:01:06,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:01:06,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:01:06,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:01:06,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 05:01:06,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:01:06,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:01:06,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:01:06,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 05:01:06,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:01:06,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:01:06,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:01:06,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:01:06,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 05:01:06,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:01:06,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 05:01:06,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:01:06,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:01:06,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:01:06,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 05:01:06,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 05:01:06,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 05:01:06,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 05:01:06,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 05:01:06,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 05:01:06,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 05:01:06,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-07 05:01:06,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:01:06,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857792752] [2024-11-07 05:01:06,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857792752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:01:06,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:01:06,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:01:06,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749654572] [2024-11-07 05:01:06,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:01:06,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 05:01:06,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:01:06,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 05:01:06,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:01:06,149 INFO L87 Difference]: Start difference. First operand 92 states and 136 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 05:01:06,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:01:06,204 INFO L93 Difference]: Finished difference Result 265 states and 395 transitions. [2024-11-07 05:01:06,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:01:06,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2024-11-07 05:01:06,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:01:06,207 INFO L225 Difference]: With dead ends: 265 [2024-11-07 05:01:06,207 INFO L226 Difference]: Without dead ends: 176 [2024-11-07 05:01:06,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:01:06,210 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 114 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 05:01:06,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 239 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:01:06,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-07 05:01:06,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 118. [2024-11-07 05:01:06,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 90 states have (on average 1.3666666666666667) internal successors, (123), 90 states have internal predecessors, (123), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 05:01:06,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 175 transitions. [2024-11-07 05:01:06,231 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 175 transitions. Word has length 174 [2024-11-07 05:01:06,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:01:06,232 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 175 transitions. [2024-11-07 05:01:06,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 05:01:06,236 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 175 transitions. [2024-11-07 05:01:06,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-07 05:01:06,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:01:06,238 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:01:06,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 05:01:06,238 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:01:06,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:01:06,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1162707575, now seen corresponding path program 1 times [2024-11-07 05:01:06,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:01:06,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839697294] [2024-11-07 05:01:06,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:01:06,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:01:06,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:01:06,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:01:06,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:01:06,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:01:06,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 05:01:06,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:01:06,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:01:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:01:06,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 05:01:06,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:01:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:01:06,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:01:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:01:06,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 05:01:06,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:01:06,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 05:01:06,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:01:06,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:01:06,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:01:06,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 05:01:06,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 05:01:06,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 05:01:06,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 05:01:06,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 05:01:06,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 05:01:06,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 05:01:06,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:06,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-07 05:01:06,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:01:06,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839697294] [2024-11-07 05:01:06,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839697294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:01:06,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:01:06,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 05:01:06,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122207189] [2024-11-07 05:01:06,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:01:06,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 05:01:06,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:01:06,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 05:01:06,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 05:01:06,985 INFO L87 Difference]: Start difference. First operand 118 states and 175 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 05:01:07,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:01:07,695 INFO L93 Difference]: Finished difference Result 438 states and 632 transitions. [2024-11-07 05:01:07,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 05:01:07,696 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2024-11-07 05:01:07,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:01:07,699 INFO L225 Difference]: With dead ends: 438 [2024-11-07 05:01:07,703 INFO L226 Difference]: Without dead ends: 323 [2024-11-07 05:01:07,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-07 05:01:07,704 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 191 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 05:01:07,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 891 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 05:01:07,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-11-07 05:01:07,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 250. [2024-11-07 05:01:07,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 207 states have (on average 1.3719806763285025) internal successors, (284), 209 states have internal predecessors, (284), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-07 05:01:07,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 362 transitions. [2024-11-07 05:01:07,730 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 362 transitions. Word has length 174 [2024-11-07 05:01:07,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:01:07,731 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 362 transitions. [2024-11-07 05:01:07,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 05:01:07,732 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 362 transitions. [2024-11-07 05:01:07,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-07 05:01:07,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:01:07,734 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:01:07,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 05:01:07,734 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:01:07,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:01:07,735 INFO L85 PathProgramCache]: Analyzing trace with hash 960649876, now seen corresponding path program 1 times [2024-11-07 05:01:07,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:01:07,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126514872] [2024-11-07 05:01:07,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:01:07,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:01:07,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:07,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:01:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:07,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:01:07,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:07,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:01:07,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:07,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:01:07,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:07,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 05:01:07,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:07,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:01:07,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:07,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:01:07,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:07,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:01:07,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:07,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 05:01:07,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:07,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:01:07,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:07,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:01:07,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:07,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:01:07,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:07,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:01:07,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:07,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 05:01:07,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:07,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:01:07,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:07,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 05:01:07,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:07,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:01:07,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:07,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:01:07,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:07,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:01:07,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:07,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 05:01:07,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:07,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 05:01:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:07,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 05:01:07,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:07,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 05:01:07,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:07,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 05:01:07,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:07,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 05:01:07,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:07,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 05:01:08,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:08,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-07 05:01:08,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:01:08,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126514872] [2024-11-07 05:01:08,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126514872] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 05:01:08,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399309136] [2024-11-07 05:01:08,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:01:08,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:01:08,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:01:08,006 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 05:01:08,008 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 05:01:08,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:08,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 05:01:08,176 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:01:08,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 361 proven. 75 refuted. 0 times theorem prover too weak. 864 trivial. 0 not checked. [2024-11-07 05:01:08,697 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 05:01:08,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-07 05:01:08,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399309136] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 05:01:08,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 05:01:08,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-07 05:01:08,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163421625] [2024-11-07 05:01:08,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 05:01:08,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 05:01:08,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:01:08,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 05:01:08,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-07 05:01:08,983 INFO L87 Difference]: Start difference. First operand 250 states and 362 transitions. Second operand has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 6 states have call successors, (76), 3 states have call predecessors, (76), 5 states have return successors, (77), 5 states have call predecessors, (77), 6 states have call successors, (77) [2024-11-07 05:01:09,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:01:09,253 INFO L93 Difference]: Finished difference Result 519 states and 738 transitions. [2024-11-07 05:01:09,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 05:01:09,254 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 6 states have call successors, (76), 3 states have call predecessors, (76), 5 states have return successors, (77), 5 states have call predecessors, (77), 6 states have call successors, (77) Word has length 174 [2024-11-07 05:01:09,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:01:09,258 INFO L225 Difference]: With dead ends: 519 [2024-11-07 05:01:09,260 INFO L226 Difference]: Without dead ends: 272 [2024-11-07 05:01:09,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 394 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2024-11-07 05:01:09,261 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 163 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 05:01:09,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 215 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 05:01:09,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-11-07 05:01:09,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 270. [2024-11-07 05:01:09,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 222 states have (on average 1.3288288288288288) internal successors, (295), 224 states have internal predecessors, (295), 39 states have call successors, (39), 8 states have call predecessors, (39), 8 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-07 05:01:09,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 373 transitions. [2024-11-07 05:01:09,284 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 373 transitions. Word has length 174 [2024-11-07 05:01:09,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:01:09,285 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 373 transitions. [2024-11-07 05:01:09,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 6 states have call successors, (76), 3 states have call predecessors, (76), 5 states have return successors, (77), 5 states have call predecessors, (77), 6 states have call successors, (77) [2024-11-07 05:01:09,286 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 373 transitions. [2024-11-07 05:01:09,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-07 05:01:09,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:01:09,288 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:01:09,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 05:01:09,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:01:09,489 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:01:09,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:01:09,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1033494830, now seen corresponding path program 1 times [2024-11-07 05:01:09,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:01:09,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240008366] [2024-11-07 05:01:09,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:01:09,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:01:09,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 05:01:09,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [816493473] [2024-11-07 05:01:09,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:01:09,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:01:09,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:01:09,608 INFO L229 MonitoredProcess]: Starting monitored process 3 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 05:01:09,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 05:01:09,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:09,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-07 05:01:09,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:01:10,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 369 proven. 63 refuted. 0 times theorem prover too weak. 868 trivial. 0 not checked. [2024-11-07 05:01:10,037 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 05:01:10,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 12 proven. 63 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-07 05:01:10,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:01:10,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240008366] [2024-11-07 05:01:10,408 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 05:01:10,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816493473] [2024-11-07 05:01:10,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816493473] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 05:01:10,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 05:01:10,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-07 05:01:10,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607119992] [2024-11-07 05:01:10,409 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 05:01:10,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 05:01:10,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:01:10,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 05:01:10,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-11-07 05:01:10,413 INFO L87 Difference]: Start difference. First operand 270 states and 373 transitions. Second operand has 16 states, 16 states have (on average 5.1875) internal successors, (83), 16 states have internal predecessors, (83), 3 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 3 states have call predecessors, (48), 3 states have call successors, (48) [2024-11-07 05:01:11,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:01:11,630 INFO L93 Difference]: Finished difference Result 680 states and 905 transitions. [2024-11-07 05:01:11,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 05:01:11,631 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.1875) internal successors, (83), 16 states have internal predecessors, (83), 3 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 3 states have call predecessors, (48), 3 states have call successors, (48) Word has length 174 [2024-11-07 05:01:11,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:01:11,635 INFO L225 Difference]: With dead ends: 680 [2024-11-07 05:01:11,635 INFO L226 Difference]: Without dead ends: 413 [2024-11-07 05:01:11,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2024-11-07 05:01:11,637 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 230 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 05:01:11,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 858 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 05:01:11,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-07 05:01:11,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 258. [2024-11-07 05:01:11,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 212 states have (on average 1.3160377358490567) internal successors, (279), 213 states have internal predecessors, (279), 37 states have call successors, (37), 8 states have call predecessors, (37), 8 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-07 05:01:11,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 353 transitions. [2024-11-07 05:01:11,670 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 353 transitions. Word has length 174 [2024-11-07 05:01:11,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:01:11,670 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 353 transitions. [2024-11-07 05:01:11,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.1875) internal successors, (83), 16 states have internal predecessors, (83), 3 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 3 states have call predecessors, (48), 3 states have call successors, (48) [2024-11-07 05:01:11,671 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 353 transitions. [2024-11-07 05:01:11,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-07 05:01:11,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:01:11,674 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:01:11,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-07 05:01:11,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:01:11,875 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:01:11,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:01:11,876 INFO L85 PathProgramCache]: Analyzing trace with hash -740005749, now seen corresponding path program 1 times [2024-11-07 05:01:11,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:01:11,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313603468] [2024-11-07 05:01:11,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:01:11,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:01:11,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:12,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:01:12,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:12,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:01:12,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:12,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:01:12,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:12,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:01:12,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:12,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 05:01:12,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:12,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:01:12,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:12,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:01:12,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:12,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:01:12,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:12,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 05:01:12,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:12,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:01:12,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:12,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:01:12,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:12,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:01:12,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:12,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:01:12,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:12,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 05:01:12,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:12,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:01:12,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:12,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 05:01:12,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:12,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:01:12,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:12,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:01:12,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:12,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:01:12,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:12,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 05:01:12,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:12,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 05:01:12,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:12,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 05:01:12,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:12,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 05:01:12,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:12,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 05:01:12,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:12,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 05:01:12,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:12,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 05:01:12,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:12,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-07 05:01:12,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:01:12,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313603468] [2024-11-07 05:01:12,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313603468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:01:12,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:01:12,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 05:01:12,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997354329] [2024-11-07 05:01:12,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:01:12,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 05:01:12,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:01:12,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 05:01:12,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 05:01:12,365 INFO L87 Difference]: Start difference. First operand 258 states and 353 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 05:01:13,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:01:13,027 INFO L93 Difference]: Finished difference Result 752 states and 1009 transitions. [2024-11-07 05:01:13,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 05:01:13,028 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2024-11-07 05:01:13,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:01:13,033 INFO L225 Difference]: With dead ends: 752 [2024-11-07 05:01:13,034 INFO L226 Difference]: Without dead ends: 497 [2024-11-07 05:01:13,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 05:01:13,036 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 143 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 05:01:13,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 860 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 05:01:13,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2024-11-07 05:01:13,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 265. [2024-11-07 05:01:13,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 219 states have (on average 1.3196347031963471) internal successors, (289), 220 states have internal predecessors, (289), 37 states have call successors, (37), 8 states have call predecessors, (37), 8 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-07 05:01:13,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 363 transitions. [2024-11-07 05:01:13,072 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 363 transitions. Word has length 174 [2024-11-07 05:01:13,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:01:13,073 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 363 transitions. [2024-11-07 05:01:13,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 05:01:13,074 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 363 transitions. [2024-11-07 05:01:13,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-07 05:01:13,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:01:13,076 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:01:13,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 05:01:13,076 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:01:13,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:01:13,077 INFO L85 PathProgramCache]: Analyzing trace with hash -2143999383, now seen corresponding path program 1 times [2024-11-07 05:01:13,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:01:13,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944165345] [2024-11-07 05:01:13,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:01:13,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:01:13,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:13,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:01:13,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:13,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:01:13,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:13,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:01:13,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:13,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:01:13,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:13,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 05:01:13,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:13,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:01:13,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:13,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:01:13,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:13,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:01:13,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:13,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 05:01:13,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:13,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:01:13,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:13,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:01:13,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:13,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:01:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:13,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:01:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:13,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 05:01:13,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:13,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:01:13,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:13,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 05:01:13,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:13,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:01:13,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:13,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:01:13,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:13,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:01:13,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:13,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 05:01:13,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:13,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 05:01:13,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:13,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 05:01:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:13,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 05:01:13,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:13,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 05:01:13,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:13,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 05:01:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:13,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 05:01:13,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:13,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-07 05:01:13,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:01:13,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944165345] [2024-11-07 05:01:13,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944165345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:01:13,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:01:13,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 05:01:13,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619369989] [2024-11-07 05:01:13,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:01:13,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 05:01:13,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:01:13,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 05:01:13,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 05:01:13,503 INFO L87 Difference]: Start difference. First operand 265 states and 363 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 05:01:13,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:01:13,871 INFO L93 Difference]: Finished difference Result 697 states and 939 transitions. [2024-11-07 05:01:13,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 05:01:13,872 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2024-11-07 05:01:13,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:01:13,875 INFO L225 Difference]: With dead ends: 697 [2024-11-07 05:01:13,875 INFO L226 Difference]: Without dead ends: 435 [2024-11-07 05:01:13,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-07 05:01:13,877 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 77 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 05:01:13,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 770 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 05:01:13,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2024-11-07 05:01:13,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 290. [2024-11-07 05:01:13,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 244 states have (on average 1.319672131147541) internal successors, (322), 245 states have internal predecessors, (322), 37 states have call successors, (37), 8 states have call predecessors, (37), 8 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-07 05:01:13,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 396 transitions. [2024-11-07 05:01:13,901 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 396 transitions. Word has length 175 [2024-11-07 05:01:13,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:01:13,901 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 396 transitions. [2024-11-07 05:01:13,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 05:01:13,901 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 396 transitions. [2024-11-07 05:01:13,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-07 05:01:13,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:01:13,904 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:01:13,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 05:01:13,904 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:01:13,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:01:13,905 INFO L85 PathProgramCache]: Analyzing trace with hash -734992903, now seen corresponding path program 1 times [2024-11-07 05:01:13,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:01:13,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160946288] [2024-11-07 05:01:13,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:01:13,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:01:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 05:01:13,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [90775243] [2024-11-07 05:01:13,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:01:13,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:01:13,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:01:13,959 INFO L229 MonitoredProcess]: Starting monitored process 4 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 05:01:13,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 05:01:14,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 05:01:14,104 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 05:01:14,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 05:01:14,295 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 05:01:14,295 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 05:01:14,296 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 05:01:14,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 05:01:14,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:01:14,551 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:01:14,698 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 05:01:14,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:01:14 BoogieIcfgContainer [2024-11-07 05:01:14,703 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 05:01:14,704 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 05:01:14,704 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 05:01:14,704 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 05:01:14,705 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:00:53" (3/4) ... [2024-11-07 05:01:14,706 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 05:01:14,707 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 05:01:14,709 INFO L158 Benchmark]: Toolchain (without parser) took 22650.85ms. Allocated memory was 117.4MB in the beginning and 343.9MB in the end (delta: 226.5MB). Free memory was 91.6MB in the beginning and 154.0MB in the end (delta: -62.4MB). Peak memory consumption was 160.4MB. Max. memory is 16.1GB. [2024-11-07 05:01:14,709 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 117.4MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 05:01:14,709 INFO L158 Benchmark]: CACSL2BoogieTranslator took 365.68ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 77.3MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 05:01:14,709 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.01ms. Allocated memory is still 117.4MB. Free memory was 77.3MB in the beginning and 74.4MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 05:01:14,709 INFO L158 Benchmark]: Boogie Preprocessor took 64.29ms. Allocated memory is still 117.4MB. Free memory was 74.4MB in the beginning and 71.4MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 05:01:14,710 INFO L158 Benchmark]: RCFGBuilder took 635.21ms. Allocated memory is still 117.4MB. Free memory was 71.4MB in the beginning and 48.3MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 05:01:14,710 INFO L158 Benchmark]: TraceAbstraction took 21508.54ms. Allocated memory was 117.4MB in the beginning and 343.9MB in the end (delta: 226.5MB). Free memory was 47.8MB in the beginning and 154.1MB in the end (delta: -106.3MB). Peak memory consumption was 118.5MB. Max. memory is 16.1GB. [2024-11-07 05:01:14,710 INFO L158 Benchmark]: Witness Printer took 3.44ms. Allocated memory is still 343.9MB. Free memory was 154.1MB in the beginning and 154.0MB in the end (delta: 86.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 05:01:14,712 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 117.4MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 365.68ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 77.3MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.01ms. Allocated memory is still 117.4MB. Free memory was 77.3MB in the beginning and 74.4MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 64.29ms. Allocated memory is still 117.4MB. Free memory was 74.4MB in the beginning and 71.4MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 635.21ms. Allocated memory is still 117.4MB. Free memory was 71.4MB in the beginning and 48.3MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 21508.54ms. Allocated memory was 117.4MB in the beginning and 343.9MB in the end (delta: 226.5MB). Free memory was 47.8MB in the beginning and 154.1MB in the end (delta: -106.3MB). Peak memory consumption was 118.5MB. Max. memory is 16.1GB. * Witness Printer took 3.44ms. Allocated memory is still 343.9MB. Free memory was 154.1MB in the beginning and 154.0MB in the end (delta: 86.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 158, overapproximation of shiftLeft at line 158. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L23] signed short int var_1_3 = 1; [L24] signed long int var_1_5 = -64; [L25] signed char var_1_6 = 10; [L26] signed char var_1_7 = 5; [L27] double var_1_8 = 16.25; [L28] double var_1_9 = 1.8; [L29] unsigned char var_1_10 = 32; [L30] unsigned char var_1_11 = 64; [L31] unsigned short int var_1_12 = 16; [L32] unsigned long int var_1_13 = 128; [L33] unsigned char var_1_15 = 1; [L34] unsigned short int var_1_16 = 256; [L35] signed char var_1_18 = -2; [L36] unsigned long int var_1_19 = 50; [L37] unsigned char var_1_20 = 0; [L38] unsigned char var_1_21 = 0; [L39] unsigned long int var_1_22 = 0; [L40] unsigned char var_1_23 = 64; [L41] unsigned char var_1_24 = 2; [L42] double var_1_25 = 127.75; [L43] double var_1_26 = 99999999.01; [L44] float var_1_27 = 999999999.5; [L45] unsigned char var_1_28 = 2; [L46] unsigned char var_1_29 = 0; [L47] signed char var_1_30 = 5; [L48] signed char var_1_31 = 25; [L49] unsigned char last_1_var_1_10 = 32; [L50] unsigned short int last_1_var_1_12 = 16; [L51] unsigned long int last_1_var_1_13 = 128; VAL [isInitial=0, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L162] isInitial = 1 [L163] FCALL initially() [L164] COND TRUE 1 [L165] CALL updateLastVariables() [L153] last_1_var_1_10 = var_1_10 [L154] last_1_var_1_12 = var_1_12 [L155] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L165] RET updateLastVariables() [L166] CALL updateVariables() [L111] var_1_3 = __VERIFIER_nondet_short() [L112] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L112] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L113] CALL assume_abort_if_not(var_1_3 <= 8) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L113] RET assume_abort_if_not(var_1_3 <= 8) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L114] var_1_5 = __VERIFIER_nondet_long() [L115] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L115] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L116] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L116] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L117] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L117] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L118] var_1_6 = __VERIFIER_nondet_char() [L119] CALL assume_abort_if_not(var_1_6 >= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L119] RET assume_abort_if_not(var_1_6 >= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L120] CALL assume_abort_if_not(var_1_6 <= 12) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L120] RET assume_abort_if_not(var_1_6 <= 12) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L121] var_1_7 = __VERIFIER_nondet_char() [L122] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L122] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L123] CALL assume_abort_if_not(var_1_7 <= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L123] RET assume_abort_if_not(var_1_7 <= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L124] var_1_8 = __VERIFIER_nondet_double() [L125] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_9=9/5] [L125] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_9=9/5] [L126] var_1_9 = __VERIFIER_nondet_double() [L127] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L127] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L128] var_1_11 = __VERIFIER_nondet_uchar() [L129] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L129] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L130] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L130] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L131] var_1_15 = __VERIFIER_nondet_uchar() [L132] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L132] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L133] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L133] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L134] var_1_20 = __VERIFIER_nondet_uchar() [L135] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L135] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L136] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L136] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L137] var_1_21 = __VERIFIER_nondet_uchar() [L138] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L138] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L139] CALL assume_abort_if_not(var_1_21 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L139] RET assume_abort_if_not(var_1_21 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L140] var_1_22 = __VERIFIER_nondet_ulong() [L141] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L141] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L142] CALL assume_abort_if_not(var_1_22 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L142] RET assume_abort_if_not(var_1_22 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L143] var_1_24 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L144] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L145] CALL assume_abort_if_not(var_1_24 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L145] RET assume_abort_if_not(var_1_24 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L146] var_1_26 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_26 >= -922337.2036854765600e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854765600e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=511/4, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=511/4, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L147] RET assume_abort_if_not((var_1_26 >= -922337.2036854765600e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854765600e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=511/4, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L148] var_1_31 = __VERIFIER_nondet_char() [L149] CALL assume_abort_if_not(var_1_31 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=511/4, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=511/4, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L149] RET assume_abort_if_not(var_1_31 >= -127) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=511/4, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L150] CALL assume_abort_if_not(var_1_31 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=511/4, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=511/4, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L150] RET assume_abort_if_not(var_1_31 <= 126) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=511/4, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L166] RET updateVariables() [L167] CALL step() [L55] COND TRUE var_1_20 || var_1_21 [L56] var_1_19 = ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=511/4, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L58] var_1_23 = var_1_24 [L59] var_1_25 = var_1_26 [L60] var_1_27 = var_1_26 [L61] var_1_28 = 16 [L62] var_1_29 = 0 [L63] var_1_30 = var_1_31 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L64] COND TRUE ((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10 [L65] var_1_12 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L67] signed long int stepLocal_2 = last_1_var_1_12 + var_1_7; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_2=16, var_1_10=32, var_1_11=254, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L68] COND TRUE var_1_6 <= stepLocal_2 [L69] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L73] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L73] COND FALSE !((1 << var_1_10) != (-500 / -100)) [L80] var_1_13 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L82] var_1_18 = var_1_3 [L83] signed long int stepLocal_4 = (((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64))); [L84] unsigned char stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=254, stepLocal_4=254, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=256, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L85] COND FALSE !((- var_1_9) <= var_1_8) [L98] var_1_16 = var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=254, stepLocal_4=254, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L100] signed long int stepLocal_1 = (var_1_10 & 0) * var_1_5; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=254, stepLocal_4=254, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L101] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=254, stepLocal_4=254, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L101] signed long int stepLocal_0 = var_1_16 >> var_1_3; [L102] COND FALSE !(stepLocal_0 == (var_1_10 / var_1_5)) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=254, stepLocal_4=254, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L167] RET step() [L168] CALL, EXPR property() [L158] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L158] EXPR ((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L158] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L158] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L158] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L158-L159] return (((((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6)))) && (((- var_1_9) <= var_1_8) ? (var_1_15 ? ((((((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64)))) < var_1_12) ? ((var_1_13 == var_1_10) ? (var_1_16 == ((unsigned short int) var_1_11)) : 1) : (var_1_16 == ((unsigned short int) 256))) : (var_1_16 == ((unsigned short int) var_1_3))) : (var_1_16 == ((unsigned short int) var_1_10)))) && (var_1_18 == ((signed char) var_1_3)) ; [L168] RET, EXPR property() [L168] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 93 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.3s, OverallIterations: 13, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1421 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1415 mSDsluCounter, 6367 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4651 mSDsCounter, 87 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3003 IncrementalHoareTripleChecker+Invalid, 3090 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 87 mSolverCounterUnsat, 1716 mSDtfsCounter, 3003 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1408 GetRequests, 1313 SyntacticMatches, 4 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=290occurred in iteration=12, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 934 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 12.2s InterpolantComputationTime, 2774 NumberOfCodeBlocks, 2774 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2583 ConstructedInterpolants, 0 QuantifiedInterpolants, 7841 SizeOfPredicates, 9 NumberOfNonLiveVariables, 842 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 15 InterpolantComputations, 10 PerfectInterpolantSequences, 19149/19500 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 05:01:14,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-9.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 afbe11d6255891eb62142fb858f033cde06ed708dce6d7f48966c5c7a69497ae --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 05:01:17,167 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 05:01:17,287 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 05:01:17,296 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 05:01:17,296 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 05:01:17,327 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 05:01:17,329 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 05:01:17,329 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 05:01:17,330 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 05:01:17,330 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 05:01:17,330 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 05:01:17,330 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 05:01:17,331 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 05:01:17,331 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 05:01:17,331 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 05:01:17,331 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 05:01:17,332 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 05:01:17,332 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 05:01:17,333 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 05:01:17,333 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 05:01:17,333 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 05:01:17,333 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 05:01:17,333 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 05:01:17,333 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 05:01:17,333 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 05:01:17,333 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 05:01:17,333 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 05:01:17,334 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 05:01:17,334 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 05:01:17,334 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 05:01:17,334 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 05:01:17,334 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 05:01:17,334 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 05:01:17,334 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 05:01:17,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:01:17,334 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 05:01:17,334 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 05:01:17,334 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 05:01:17,334 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 05:01:17,334 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 05:01:17,334 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 05:01:17,334 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 05:01:17,335 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 05:01:17,335 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 05:01:17,335 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 -> afbe11d6255891eb62142fb858f033cde06ed708dce6d7f48966c5c7a69497ae [2024-11-07 05:01:17,654 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 05:01:17,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 05:01:17,664 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 05:01:17,665 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 05:01:17,666 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 05:01:17,667 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-9.i [2024-11-07 05:01:19,125 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 05:01:19,400 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 05:01:19,402 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-9.i [2024-11-07 05:01:19,412 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2bcd7bfdf/aa7b726cd7cb470c822be7f6820efcf8/FLAG4df335299 [2024-11-07 05:01:19,435 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2bcd7bfdf/aa7b726cd7cb470c822be7f6820efcf8 [2024-11-07 05:01:19,440 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 05:01:19,442 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 05:01:19,443 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 05:01:19,443 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 05:01:19,447 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 05:01:19,452 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:01:19" (1/1) ... [2024-11-07 05:01:19,454 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a8e159d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:01:19, skipping insertion in model container [2024-11-07 05:01:19,455 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:01:19" (1/1) ... [2024-11-07 05:01:19,476 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 05:01:19,622 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-9.i[914,927] [2024-11-07 05:01:19,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:01:19,733 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 05:01:19,743 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-9.i[914,927] [2024-11-07 05:01:19,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:01:19,811 INFO L204 MainTranslator]: Completed translation [2024-11-07 05:01:19,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:01:19 WrapperNode [2024-11-07 05:01:19,813 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 05:01:19,814 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 05:01:19,815 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 05:01:19,815 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 05:01:19,823 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:01:19" (1/1) ... [2024-11-07 05:01:19,841 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:01:19" (1/1) ... [2024-11-07 05:01:19,874 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 171 [2024-11-07 05:01:19,878 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 05:01:19,879 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 05:01:19,880 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 05:01:19,880 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 05:01:19,892 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:01:19" (1/1) ... [2024-11-07 05:01:19,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:01:19" (1/1) ... [2024-11-07 05:01:19,897 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:01:19" (1/1) ... [2024-11-07 05:01:19,919 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 05:01:19,922 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:01:19" (1/1) ... [2024-11-07 05:01:19,922 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:01:19" (1/1) ... [2024-11-07 05:01:19,930 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:01:19" (1/1) ... [2024-11-07 05:01:19,934 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:01:19" (1/1) ... [2024-11-07 05:01:19,936 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:01:19" (1/1) ... [2024-11-07 05:01:19,937 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:01:19" (1/1) ... [2024-11-07 05:01:19,940 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 05:01:19,941 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 05:01:19,941 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 05:01:19,941 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 05:01:19,942 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:01:19" (1/1) ... [2024-11-07 05:01:19,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:01:19,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:01:19,983 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 05:01:19,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 05:01:20,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 05:01:20,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 05:01:20,010 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 05:01:20,010 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 05:01:20,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 05:01:20,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 05:01:20,110 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 05:01:20,111 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 05:01:20,546 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-07 05:01:20,546 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 05:01:20,557 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 05:01:20,558 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 05:01:20,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:01:20 BoogieIcfgContainer [2024-11-07 05:01:20,559 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 05:01:20,561 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 05:01:20,562 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 05:01:20,566 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 05:01:20,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:01:19" (1/3) ... [2024-11-07 05:01:20,568 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f328448 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:01:20, skipping insertion in model container [2024-11-07 05:01:20,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:01:19" (2/3) ... [2024-11-07 05:01:20,568 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f328448 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:01:20, skipping insertion in model container [2024-11-07 05:01:20,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:01:20" (3/3) ... [2024-11-07 05:01:20,569 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-9.i [2024-11-07 05:01:20,583 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 05:01:20,584 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 05:01:20,647 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 05:01:20,661 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;@85c39b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 05:01:20,662 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 05:01:20,669 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 46 states have internal predecessors, (61), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 05:01:20,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-07 05:01:20,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:01:20,681 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:01:20,683 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:01:20,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:01:20,688 INFO L85 PathProgramCache]: Analyzing trace with hash 278698665, now seen corresponding path program 1 times [2024-11-07 05:01:20,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:01:20,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1321386842] [2024-11-07 05:01:20,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:01:20,703 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 05:01:20,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:01:20,706 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 05:01:20,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 05:01:20,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:21,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 05:01:21,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:01:21,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked. [2024-11-07 05:01:21,070 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 05:01:21,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:01:21,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1321386842] [2024-11-07 05:01:21,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1321386842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:01:21,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:01:21,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 05:01:21,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944323325] [2024-11-07 05:01:21,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:01:21,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 05:01:21,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:01:21,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 05:01:21,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 05:01:21,104 INFO L87 Difference]: Start difference. First operand has 74 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 46 states have internal predecessors, (61), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-07 05:01:21,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:01:21,132 INFO L93 Difference]: Finished difference Result 141 states and 246 transitions. [2024-11-07 05:01:21,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 05:01:21,134 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 163 [2024-11-07 05:01:21,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:01:21,139 INFO L225 Difference]: With dead ends: 141 [2024-11-07 05:01:21,139 INFO L226 Difference]: Without dead ends: 70 [2024-11-07 05:01:21,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 05:01:21,145 INFO L432 NwaCegarLoop]: 105 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, 105 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 05:01:21,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:01:21,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-07 05:01:21,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-07 05:01:21,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 05:01:21,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 105 transitions. [2024-11-07 05:01:21,197 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 105 transitions. Word has length 163 [2024-11-07 05:01:21,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:01:21,199 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 105 transitions. [2024-11-07 05:01:21,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-07 05:01:21,200 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 105 transitions. [2024-11-07 05:01:21,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-07 05:01:21,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:01:21,208 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:01:21,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-07 05:01:21,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 05:01:21,409 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:01:21,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:01:21,409 INFO L85 PathProgramCache]: Analyzing trace with hash 2045374101, now seen corresponding path program 1 times [2024-11-07 05:01:21,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:01:21,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [423101502] [2024-11-07 05:01:21,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:01:21,411 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 05:01:21,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:01:21,413 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 05:01:21,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 05:01:21,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:01:21,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-07 05:01:21,707 INFO L278 TraceCheckSpWp]: Computing forward predicates...