./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-66.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', '1cf6e6673b438699da9ee704d05513145f047cb3df96501a17b1bf1cde58831e'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-66.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 1cf6e6673b438699da9ee704d05513145f047cb3df96501a17b1bf1cde58831e --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:56:34,435 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:56:34,494 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 08:56:34,502 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:56:34,502 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:56:34,527 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:56:34,528 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:56:34,528 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:56:34,528 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:56:34,529 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:56:34,529 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:56:34,529 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:56:34,529 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:56:34,529 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:56:34,529 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:56:34,529 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:56:34,529 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:56:34,529 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:56:34,529 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 08:56:34,530 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:56:34,530 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:56:34,530 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:56:34,530 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:56:34,530 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:56:34,530 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:56:34,530 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:56:34,530 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:56:34,530 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:56:34,530 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:56:34,530 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:56:34,530 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:56:34,530 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:56:34,530 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:56:34,530 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:56:34,530 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:56:34,530 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:56:34,530 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 08:56:34,530 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 08:56:34,530 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:56:34,531 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:56:34,531 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:56:34,531 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:56:34,531 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 -> 1cf6e6673b438699da9ee704d05513145f047cb3df96501a17b1bf1cde58831e [2024-11-07 08:56:34,731 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:56:34,738 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:56:34,740 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:56:34,740 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:56:34,740 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:56:34,742 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-66.i [2024-11-07 08:56:35,877 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:56:36,078 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:56:36,079 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-66.i [2024-11-07 08:56:36,085 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b36c5897f/0254633fb39341ed95e9d41fe95b5c9e/FLAG2949c9aa6 [2024-11-07 08:56:36,098 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b36c5897f/0254633fb39341ed95e9d41fe95b5c9e [2024-11-07 08:56:36,101 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:56:36,102 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:56:36,103 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:56:36,103 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:56:36,107 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:56:36,107 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:56:36" (1/1) ... [2024-11-07 08:56:36,109 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7205e2a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:56:36, skipping insertion in model container [2024-11-07 08:56:36,109 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:56:36" (1/1) ... [2024-11-07 08:56:36,121 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:56:36,220 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-66.i[915,928] [2024-11-07 08:56:36,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:56:36,278 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:56:36,287 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-66.i[915,928] [2024-11-07 08:56:36,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:56:36,324 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:56:36,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:56:36 WrapperNode [2024-11-07 08:56:36,324 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:56:36,325 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:56:36,325 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:56:36,325 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:56:36,329 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:56:36" (1/1) ... [2024-11-07 08:56:36,334 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:56:36" (1/1) ... [2024-11-07 08:56:36,362 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 132 [2024-11-07 08:56:36,366 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:56:36,366 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:56:36,366 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:56:36,367 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:56:36,372 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:56:36" (1/1) ... [2024-11-07 08:56:36,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:56:36" (1/1) ... [2024-11-07 08:56:36,375 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:56:36" (1/1) ... [2024-11-07 08:56:36,384 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 08:56:36,384 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:56:36" (1/1) ... [2024-11-07 08:56:36,385 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:56:36" (1/1) ... [2024-11-07 08:56:36,391 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:56:36" (1/1) ... [2024-11-07 08:56:36,393 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:56:36" (1/1) ... [2024-11-07 08:56:36,395 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:56:36" (1/1) ... [2024-11-07 08:56:36,398 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:56:36" (1/1) ... [2024-11-07 08:56:36,399 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:56:36,400 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:56:36,400 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:56:36,400 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:56:36,401 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:56:36" (1/1) ... [2024-11-07 08:56:36,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:56:36,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:56:36,430 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 08:56:36,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 08:56:36,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:56:36,451 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:56:36,451 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:56:36,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 08:56:36,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:56:36,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:56:36,510 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:56:36,511 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:56:36,741 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-07 08:56:36,741 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:56:36,749 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:56:36,749 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:56:36,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:56:36 BoogieIcfgContainer [2024-11-07 08:56:36,749 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:56:36,751 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:56:36,751 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:56:36,755 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:56:36,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:56:36" (1/3) ... [2024-11-07 08:56:36,756 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@264c6235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:56:36, skipping insertion in model container [2024-11-07 08:56:36,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:56:36" (2/3) ... [2024-11-07 08:56:36,757 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@264c6235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:56:36, skipping insertion in model container [2024-11-07 08:56:36,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:56:36" (3/3) ... [2024-11-07 08:56:36,758 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-66.i [2024-11-07 08:56:36,768 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:56:36,768 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:56:36,812 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:56:36,821 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;@73b7fb08, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:56:36,821 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:56:36,827 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 08:56:36,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 08:56:36,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:56:36,837 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:56:36,838 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:56:36,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:56:36,855 INFO L85 PathProgramCache]: Analyzing trace with hash 38250463, now seen corresponding path program 1 times [2024-11-07 08:56:36,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:56:36,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349226035] [2024-11-07 08:56:36,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:56:36,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:56:37,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:40,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:56:40,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:40,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:56:40,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:40,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:56:40,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:40,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:56:40,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:40,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:56:40,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:40,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:56:40,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:40,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:56:40,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:40,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:56:40,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:40,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:56:40,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:40,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:56:40,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:40,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:56:40,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:40,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:56:40,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:40,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:56:40,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:40,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:56:40,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:40,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:56:40,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:40,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:56:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:40,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 08:56:40,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:40,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 08:56:40,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:40,493 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 08:56:40,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:56:40,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349226035] [2024-11-07 08:56:40,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349226035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:56:40,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:56:40,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-07 08:56:40,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663451807] [2024-11-07 08:56:40,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:56:40,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 08:56:40,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:56:40,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 08:56:40,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-11-07 08:56:40,516 INFO L87 Difference]: Start difference. First operand has 61 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 08:56:41,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:56:41,243 INFO L93 Difference]: Finished difference Result 236 states and 392 transitions. [2024-11-07 08:56:41,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 08:56:41,247 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2024-11-07 08:56:41,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:56:41,253 INFO L225 Difference]: With dead ends: 236 [2024-11-07 08:56:41,255 INFO L226 Difference]: Without dead ends: 178 [2024-11-07 08:56:41,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2024-11-07 08:56:41,261 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 213 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 08:56:41,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 433 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 08:56:41,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-07 08:56:41,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 102. [2024-11-07 08:56:41,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 78 states have internal predecessors, (108), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 08:56:41,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 152 transitions. [2024-11-07 08:56:41,311 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 152 transitions. Word has length 119 [2024-11-07 08:56:41,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:56:41,312 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 152 transitions. [2024-11-07 08:56:41,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 08:56:41,312 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 152 transitions. [2024-11-07 08:56:41,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 08:56:41,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:56:41,316 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:56:41,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 08:56:41,316 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:56:41,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:56:41,316 INFO L85 PathProgramCache]: Analyzing trace with hash 40097505, now seen corresponding path program 1 times [2024-11-07 08:56:41,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:56:41,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883155913] [2024-11-07 08:56:41,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:56:41,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:56:41,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:45,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:56:45,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:45,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:56:45,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:45,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:56:45,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:45,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:56:45,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:45,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:56:45,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:45,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:56:45,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:45,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:56:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:45,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:56:45,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:45,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:56:45,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:45,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:56:45,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:45,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:56:45,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:45,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:56:45,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:45,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:56:45,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:45,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:56:45,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:45,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:56:45,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:45,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:56:45,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:45,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 08:56:45,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:45,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 08:56:45,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:45,125 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 08:56:45,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:56:45,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883155913] [2024-11-07 08:56:45,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883155913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:56:45,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:56:45,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-07 08:56:45,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234643801] [2024-11-07 08:56:45,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:56:45,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 08:56:45,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:56:45,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 08:56:45,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2024-11-07 08:56:45,130 INFO L87 Difference]: Start difference. First operand 102 states and 152 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 08:56:46,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:56:46,731 INFO L93 Difference]: Finished difference Result 178 states and 242 transitions. [2024-11-07 08:56:46,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 08:56:46,731 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2024-11-07 08:56:46,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:56:46,734 INFO L225 Difference]: With dead ends: 178 [2024-11-07 08:56:46,734 INFO L226 Difference]: Without dead ends: 176 [2024-11-07 08:56:46,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-11-07 08:56:46,735 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 186 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 08:56:46,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 534 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 08:56:46,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-07 08:56:46,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 102. [2024-11-07 08:56:46,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 78 states have internal predecessors, (108), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 08:56:46,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 152 transitions. [2024-11-07 08:56:46,749 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 152 transitions. Word has length 119 [2024-11-07 08:56:46,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:56:46,750 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 152 transitions. [2024-11-07 08:56:46,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 08:56:46,750 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 152 transitions. [2024-11-07 08:56:46,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 08:56:46,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:56:46,751 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:56:46,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 08:56:46,751 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:56:46,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:56:46,752 INFO L85 PathProgramCache]: Analyzing trace with hash 718308833, now seen corresponding path program 1 times [2024-11-07 08:56:46,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:56:46,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222263212] [2024-11-07 08:56:46,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:56:46,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:56:46,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:49,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:56:49,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:49,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:56:49,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:49,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:56:49,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:49,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:56:49,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:49,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:56:49,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:49,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:56:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:49,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:56:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:49,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:56:49,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:49,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:56:49,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:49,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:56:49,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:49,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:56:49,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:49,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:56:49,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:49,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:56:49,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:49,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:56:49,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:49,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:56:49,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:49,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:56:49,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:49,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 08:56:49,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:49,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 08:56:49,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:49,501 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 08:56:49,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:56:49,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222263212] [2024-11-07 08:56:49,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222263212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:56:49,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:56:49,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-07 08:56:49,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204462329] [2024-11-07 08:56:49,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:56:49,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 08:56:49,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:56:49,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 08:56:49,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-11-07 08:56:49,504 INFO L87 Difference]: Start difference. First operand 102 states and 152 transitions. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 08:56:50,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:56:50,165 INFO L93 Difference]: Finished difference Result 185 states and 250 transitions. [2024-11-07 08:56:50,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 08:56:50,165 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2024-11-07 08:56:50,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:56:50,167 INFO L225 Difference]: With dead ends: 185 [2024-11-07 08:56:50,167 INFO L226 Difference]: Without dead ends: 183 [2024-11-07 08:56:50,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2024-11-07 08:56:50,168 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 219 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 08:56:50,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 432 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 08:56:50,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-07 08:56:50,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 106. [2024-11-07 08:56:50,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 81 states have (on average 1.4074074074074074) internal successors, (114), 82 states have internal predecessors, (114), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 08:56:50,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 158 transitions. [2024-11-07 08:56:50,178 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 158 transitions. Word has length 119 [2024-11-07 08:56:50,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:56:50,178 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 158 transitions. [2024-11-07 08:56:50,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 08:56:50,179 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 158 transitions. [2024-11-07 08:56:50,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 08:56:50,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:56:50,180 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:56:50,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 08:56:50,180 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:56:50,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:56:50,181 INFO L85 PathProgramCache]: Analyzing trace with hash 720155875, now seen corresponding path program 1 times [2024-11-07 08:56:50,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:56:50,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501742089] [2024-11-07 08:56:50,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:56:50,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:56:50,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:53,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:56:53,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:53,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:56:53,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:53,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:56:53,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:53,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:56:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:53,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:56:53,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:53,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:56:53,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:53,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:56:53,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:53,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:56:53,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:53,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:56:53,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:53,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:56:53,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:53,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:56:53,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:53,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:56:53,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:53,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:56:53,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:53,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:56:53,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:53,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:56:53,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:53,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:56:53,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:53,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 08:56:53,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:53,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 08:56:53,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:53,298 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 08:56:53,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:56:53,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501742089] [2024-11-07 08:56:53,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501742089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:56:53,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:56:53,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-07 08:56:53,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975469855] [2024-11-07 08:56:53,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:56:53,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 08:56:53,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:56:53,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 08:56:53,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2024-11-07 08:56:53,300 INFO L87 Difference]: Start difference. First operand 106 states and 158 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 08:56:54,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:56:54,327 INFO L93 Difference]: Finished difference Result 183 states and 248 transitions. [2024-11-07 08:56:54,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 08:56:54,328 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2024-11-07 08:56:54,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:56:54,329 INFO L225 Difference]: With dead ends: 183 [2024-11-07 08:56:54,329 INFO L226 Difference]: Without dead ends: 181 [2024-11-07 08:56:54,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-11-07 08:56:54,330 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 193 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 08:56:54,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 513 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 08:56:54,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-07 08:56:54,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 102. [2024-11-07 08:56:54,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 78 states have internal predecessors, (108), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 08:56:54,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 152 transitions. [2024-11-07 08:56:54,346 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 152 transitions. Word has length 119 [2024-11-07 08:56:54,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:56:54,346 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 152 transitions. [2024-11-07 08:56:54,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 08:56:54,346 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 152 transitions. [2024-11-07 08:56:54,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 08:56:54,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:56:54,348 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:56:54,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 08:56:54,348 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:56:54,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:56:54,348 INFO L85 PathProgramCache]: Analyzing trace with hash 296415901, now seen corresponding path program 1 times [2024-11-07 08:56:54,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:56:54,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198961200] [2024-11-07 08:56:54,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:56:54,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:56:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:54,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:56:54,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:54,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:56:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:54,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:56:54,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:54,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:56:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:54,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:56:54,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:54,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:56:54,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:54,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:56:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:54,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:56:54,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:54,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:56:54,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:54,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:56:54,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:54,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:56:54,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:54,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:56:54,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:54,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:56:54,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:54,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:56:54,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:54,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:56:54,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:54,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:56:54,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:54,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 08:56:54,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:54,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 08:56:54,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:54,421 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 08:56:54,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:56:54,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198961200] [2024-11-07 08:56:54,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198961200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:56:54,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:56:54,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 08:56:54,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919174753] [2024-11-07 08:56:54,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:56:54,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 08:56:54,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:56:54,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 08:56:54,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:56:54,426 INFO L87 Difference]: Start difference. First operand 102 states and 152 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 08:56:54,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:56:54,460 INFO L93 Difference]: Finished difference Result 281 states and 422 transitions. [2024-11-07 08:56:54,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 08:56:54,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2024-11-07 08:56:54,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:56:54,463 INFO L225 Difference]: With dead ends: 281 [2024-11-07 08:56:54,464 INFO L226 Difference]: Without dead ends: 182 [2024-11-07 08:56:54,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 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 08:56:54,467 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 73 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:56:54,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 222 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:56:54,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-07 08:56:54,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2024-11-07 08:56:54,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 131 states have (on average 1.3282442748091603) internal successors, (174), 133 states have internal predecessors, (174), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-07 08:56:54,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 262 transitions. [2024-11-07 08:56:54,497 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 262 transitions. Word has length 119 [2024-11-07 08:56:54,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:56:54,498 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 262 transitions. [2024-11-07 08:56:54,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 08:56:54,498 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 262 transitions. [2024-11-07 08:56:54,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 08:56:54,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:56:54,500 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:56:54,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 08:56:54,501 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:56:54,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:56:54,501 INFO L85 PathProgramCache]: Analyzing trace with hash -512930725, now seen corresponding path program 1 times [2024-11-07 08:56:54,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:56:54,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152197769] [2024-11-07 08:56:54,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:56:54,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:56:54,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:54,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:56:54,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:54,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:56:54,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:54,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:56:54,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:54,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:56:54,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:54,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:56:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:54,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:56:54,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:54,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:56:54,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:54,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:56:54,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:54,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:56:54,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:54,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:56:54,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:54,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:56:54,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:54,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:56:54,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:54,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:56:54,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:54,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:56:54,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:54,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:56:54,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:54,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:56:54,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:54,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 08:56:54,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:54,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 08:56:54,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:54,601 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 08:56:54,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:56:54,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152197769] [2024-11-07 08:56:54,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152197769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:56:54,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:56:54,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 08:56:54,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880372036] [2024-11-07 08:56:54,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:56:54,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 08:56:54,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:56:54,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 08:56:54,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:56:54,603 INFO L87 Difference]: Start difference. First operand 180 states and 262 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 08:56:54,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:56:54,755 INFO L93 Difference]: Finished difference Result 530 states and 761 transitions. [2024-11-07 08:56:54,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 08:56:54,756 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2024-11-07 08:56:54,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:56:54,758 INFO L225 Difference]: With dead ends: 530 [2024-11-07 08:56:54,758 INFO L226 Difference]: Without dead ends: 353 [2024-11-07 08:56:54,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 08:56:54,762 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 71 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 08:56:54,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 263 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 08:56:54,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-11-07 08:56:54,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 308. [2024-11-07 08:56:54,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 215 states have (on average 1.2976744186046512) internal successors, (279), 218 states have internal predecessors, (279), 84 states have call successors, (84), 8 states have call predecessors, (84), 8 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-07 08:56:54,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 447 transitions. [2024-11-07 08:56:54,807 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 447 transitions. Word has length 119 [2024-11-07 08:56:54,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:56:54,807 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 447 transitions. [2024-11-07 08:56:54,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 08:56:54,807 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 447 transitions. [2024-11-07 08:56:54,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 08:56:54,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:56:54,808 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:56:54,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 08:56:54,808 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:56:54,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:56:54,809 INFO L85 PathProgramCache]: Analyzing trace with hash 167127645, now seen corresponding path program 1 times [2024-11-07 08:56:54,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:56:54,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867880751] [2024-11-07 08:56:54,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:56:54,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:56:54,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:56,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:56:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:56,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:56:56,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:56,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:56:56,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:56,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:56:56,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:56,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:56:56,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:56,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:56:56,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:56,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:56:56,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:56,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:56:56,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:56,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:56:56,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:56,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:56:56,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:56,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:56:56,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:56,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:56:56,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:56,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:56:56,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:56,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:56:56,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:56,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:56:56,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:56,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:56:56,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:56,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 08:56:56,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:56,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 08:56:56,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:56,053 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 08:56:56,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:56:56,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867880751] [2024-11-07 08:56:56,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867880751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:56:56,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:56:56,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 08:56:56,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793744558] [2024-11-07 08:56:56,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:56:56,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 08:56:56,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:56:56,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 08:56:56,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-11-07 08:56:56,055 INFO L87 Difference]: Start difference. First operand 308 states and 447 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 08:56:56,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:56:56,748 INFO L93 Difference]: Finished difference Result 454 states and 614 transitions. [2024-11-07 08:56:56,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 08:56:56,749 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2024-11-07 08:56:56,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:56:56,752 INFO L225 Difference]: With dead ends: 454 [2024-11-07 08:56:56,752 INFO L226 Difference]: Without dead ends: 452 [2024-11-07 08:56:56,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-07 08:56:56,753 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 243 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 08:56:56,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 507 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 08:56:56,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2024-11-07 08:56:56,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 364. [2024-11-07 08:56:56,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 260 states have (on average 1.2769230769230768) internal successors, (332), 265 states have internal predecessors, (332), 92 states have call successors, (92), 11 states have call predecessors, (92), 11 states have return successors, (92), 87 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-07 08:56:56,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 516 transitions. [2024-11-07 08:56:56,794 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 516 transitions. Word has length 119 [2024-11-07 08:56:56,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:56:56,794 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 516 transitions. [2024-11-07 08:56:56,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 08:56:56,794 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 516 transitions. [2024-11-07 08:56:56,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 08:56:56,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:56:56,795 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:56:56,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 08:56:56,795 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:56:56,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:56:56,796 INFO L85 PathProgramCache]: Analyzing trace with hash 168974687, now seen corresponding path program 1 times [2024-11-07 08:56:56,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:56:56,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350050994] [2024-11-07 08:56:56,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:56:56,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:56:56,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:58,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:56:58,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:58,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:56:58,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:58,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:56:58,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:58,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:56:58,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:58,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:56:58,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:58,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:56:58,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:58,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:56:58,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:58,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:56:58,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:58,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:56:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:58,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:56:58,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:58,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:56:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:58,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:56:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:58,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:56:58,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:58,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:56:58,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:58,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:56:58,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:58,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:56:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:58,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 08:56:58,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:58,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 08:56:58,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:56:58,875 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 08:56:58,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:56:58,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350050994] [2024-11-07 08:56:58,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350050994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:56:58,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:56:58,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-07 08:56:58,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863323227] [2024-11-07 08:56:58,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:56:58,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 08:56:58,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:56:58,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 08:56:58,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2024-11-07 08:56:58,876 INFO L87 Difference]: Start difference. First operand 364 states and 516 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 08:57:00,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:57:00,119 INFO L93 Difference]: Finished difference Result 452 states and 612 transitions. [2024-11-07 08:57:00,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 08:57:00,120 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2024-11-07 08:57:00,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:57:00,122 INFO L225 Difference]: With dead ends: 452 [2024-11-07 08:57:00,122 INFO L226 Difference]: Without dead ends: 450 [2024-11-07 08:57:00,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2024-11-07 08:57:00,122 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 288 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 08:57:00,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 543 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 08:57:00,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2024-11-07 08:57:00,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 364. [2024-11-07 08:57:00,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 260 states have (on average 1.2769230769230768) internal successors, (332), 265 states have internal predecessors, (332), 92 states have call successors, (92), 11 states have call predecessors, (92), 11 states have return successors, (92), 87 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-07 08:57:00,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 516 transitions. [2024-11-07 08:57:00,161 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 516 transitions. Word has length 119 [2024-11-07 08:57:00,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:57:00,162 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 516 transitions. [2024-11-07 08:57:00,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 08:57:00,162 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 516 transitions. [2024-11-07 08:57:00,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 08:57:00,163 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:57:00,163 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:57:00,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 08:57:00,163 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:57:00,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:57:00,163 INFO L85 PathProgramCache]: Analyzing trace with hash -548555551, now seen corresponding path program 1 times [2024-11-07 08:57:00,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:57:00,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976757854] [2024-11-07 08:57:00,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:57:00,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:57:00,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:00,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:57:00,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:00,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:57:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:00,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:57:00,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:00,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:57:00,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:00,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:57:00,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:00,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:57:00,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:00,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:57:00,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:00,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:57:00,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:00,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:57:00,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:00,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:57:00,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:00,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:57:00,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:00,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:57:00,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:00,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:57:00,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:00,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:57:00,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:00,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:57:00,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:00,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:57:00,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:00,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 08:57:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:00,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 08:57:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:00,340 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 08:57:00,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:57:00,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976757854] [2024-11-07 08:57:00,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976757854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:57:00,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:57:00,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 08:57:00,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539736620] [2024-11-07 08:57:00,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:57:00,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 08:57:00,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:57:00,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 08:57:00,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:57:00,342 INFO L87 Difference]: Start difference. First operand 364 states and 516 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 08:57:00,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:57:00,529 INFO L93 Difference]: Finished difference Result 689 states and 965 transitions. [2024-11-07 08:57:00,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 08:57:00,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 119 [2024-11-07 08:57:00,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:57:00,532 INFO L225 Difference]: With dead ends: 689 [2024-11-07 08:57:00,532 INFO L226 Difference]: Without dead ends: 371 [2024-11-07 08:57:00,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 08:57:00,534 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 125 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 08:57:00,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 166 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 08:57:00,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-11-07 08:57:00,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 362. [2024-11-07 08:57:00,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 252 states have (on average 1.2341269841269842) internal successors, (311), 257 states have internal predecessors, (311), 96 states have call successors, (96), 13 states have call predecessors, (96), 13 states have return successors, (96), 91 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-07 08:57:00,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 503 transitions. [2024-11-07 08:57:00,577 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 503 transitions. Word has length 119 [2024-11-07 08:57:00,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:57:00,578 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 503 transitions. [2024-11-07 08:57:00,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 08:57:00,578 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 503 transitions. [2024-11-07 08:57:00,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-07 08:57:00,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:57:00,579 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:57:00,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 08:57:00,580 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:57:00,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:57:00,580 INFO L85 PathProgramCache]: Analyzing trace with hash 306968243, now seen corresponding path program 1 times [2024-11-07 08:57:00,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:57:00,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977272678] [2024-11-07 08:57:00,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:57:00,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:57:00,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 08:57:00,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [298014302] [2024-11-07 08:57:00,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:57:00,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:57:00,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:57:00,649 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 08:57:00,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 08:57:00,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:00,730 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-07 08:57:00,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:57:01,495 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 401 proven. 93 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-11-07 08:57:01,495 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:57:02,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:57:02,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977272678] [2024-11-07 08:57:02,097 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 08:57:02,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298014302] [2024-11-07 08:57:02,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298014302] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:57:02,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-07 08:57:02,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2024-11-07 08:57:02,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444290226] [2024-11-07 08:57:02,097 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-07 08:57:02,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-07 08:57:02,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:57:02,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-07 08:57:02,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2024-11-07 08:57:02,098 INFO L87 Difference]: Start difference. First operand 362 states and 503 transitions. Second operand has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 16 states have internal predecessors, (54), 6 states have call successors, (18), 6 states have call predecessors, (18), 8 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-07 08:57:02,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:57:02,825 INFO L93 Difference]: Finished difference Result 985 states and 1261 transitions. [2024-11-07 08:57:02,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-07 08:57:02,826 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 16 states have internal predecessors, (54), 6 states have call successors, (18), 6 states have call predecessors, (18), 8 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) Word has length 120 [2024-11-07 08:57:02,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:57:02,830 INFO L225 Difference]: With dead ends: 985 [2024-11-07 08:57:02,830 INFO L226 Difference]: Without dead ends: 667 [2024-11-07 08:57:02,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=287, Invalid=973, Unknown=0, NotChecked=0, Total=1260 [2024-11-07 08:57:02,835 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 136 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 50 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 08:57:02,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 285 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 437 Invalid, 2 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 08:57:02,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2024-11-07 08:57:02,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 553. [2024-11-07 08:57:02,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 386 states have (on average 1.1580310880829014) internal successors, (447), 397 states have internal predecessors, (447), 124 states have call successors, (124), 42 states have call predecessors, (124), 42 states have return successors, (124), 113 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-07 08:57:02,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 695 transitions. [2024-11-07 08:57:02,906 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 695 transitions. Word has length 120 [2024-11-07 08:57:02,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:57:02,906 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 695 transitions. [2024-11-07 08:57:02,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 16 states have internal predecessors, (54), 6 states have call successors, (18), 6 states have call predecessors, (18), 8 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-07 08:57:02,907 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 695 transitions. [2024-11-07 08:57:02,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-07 08:57:02,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:57:02,907 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:57:02,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 08:57:03,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-07 08:57:03,109 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:57:03,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:57:03,109 INFO L85 PathProgramCache]: Analyzing trace with hash 308815285, now seen corresponding path program 1 times [2024-11-07 08:57:03,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:57:03,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840264813] [2024-11-07 08:57:03,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:57:03,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:57:03,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 08:57:03,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [661354473] [2024-11-07 08:57:03,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:57:03,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:57:03,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:57:03,182 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 08:57:03,192 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 08:57:03,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 08:57:03,300 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 08:57:03,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 08:57:03,379 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 08:57:03,380 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 08:57:03,380 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 08:57:03,395 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 08:57:03,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:57:03,585 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:57:03,653 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 08:57:03,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:57:03 BoogieIcfgContainer [2024-11-07 08:57:03,657 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 08:57:03,658 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 08:57:03,658 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 08:57:03,658 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 08:57:03,659 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:56:36" (3/4) ... [2024-11-07 08:57:03,660 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 08:57:03,661 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 08:57:03,662 INFO L158 Benchmark]: Toolchain (without parser) took 27559.36ms. Allocated memory was 117.4MB in the beginning and 478.2MB in the end (delta: 360.7MB). Free memory was 91.7MB in the beginning and 417.1MB in the end (delta: -325.4MB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. [2024-11-07 08:57:03,662 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 117.4MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:57:03,662 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.01ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 78.1MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 08:57:03,662 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.66ms. Allocated memory is still 117.4MB. Free memory was 78.1MB in the beginning and 75.6MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:57:03,663 INFO L158 Benchmark]: Boogie Preprocessor took 33.14ms. Allocated memory is still 117.4MB. Free memory was 75.6MB in the beginning and 71.3MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:57:03,663 INFO L158 Benchmark]: RCFGBuilder took 349.40ms. Allocated memory is still 117.4MB. Free memory was 71.3MB in the beginning and 52.4MB in the end (delta: 18.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 08:57:03,663 INFO L158 Benchmark]: TraceAbstraction took 26906.78ms. Allocated memory was 117.4MB in the beginning and 478.2MB in the end (delta: 360.7MB). Free memory was 51.8MB in the beginning and 417.2MB in the end (delta: -365.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:57:03,664 INFO L158 Benchmark]: Witness Printer took 2.85ms. Allocated memory is still 478.2MB. Free memory was 417.2MB in the beginning and 417.1MB in the end (delta: 123.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:57:03,665 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.28ms. Allocated memory is still 117.4MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 221.01ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 78.1MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.66ms. Allocated memory is still 117.4MB. Free memory was 78.1MB in the beginning and 75.6MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.14ms. Allocated memory is still 117.4MB. Free memory was 75.6MB in the beginning and 71.3MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 349.40ms. Allocated memory is still 117.4MB. Free memory was 71.3MB in the beginning and 52.4MB in the end (delta: 18.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 26906.78ms. Allocated memory was 117.4MB in the beginning and 478.2MB in the end (delta: 360.7MB). Free memory was 51.8MB in the beginning and 417.2MB in the end (delta: -365.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.85ms. Allocated memory is still 478.2MB. Free memory was 417.2MB in the beginning and 417.1MB in the end (delta: 123.9kB). 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 120. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 50; [L23] signed char var_1_3 = 8; [L24] signed char var_1_4 = 10; [L25] double var_1_5 = 16.5; [L26] signed char var_1_6 = 64; [L27] signed char var_1_7 = 2; [L28] unsigned short int var_1_8 = 256; [L29] unsigned short int var_1_10 = 63583; [L30] unsigned short int var_1_11 = 33789; [L31] unsigned char var_1_12 = 1; [L32] unsigned char var_1_14 = 0; [L33] signed long int var_1_15 = 8; [L34] signed short int var_1_16 = -16; [L35] signed short int var_1_18 = 16; [L36] signed short int var_1_19 = 25; [L37] signed short int var_1_20 = 25; [L38] signed short int var_1_21 = 50; [L39] unsigned char last_1_var_1_12 = 1; VAL [isInitial=0, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L124] isInitial = 1 [L125] FCALL initially() [L126] COND TRUE 1 [L127] CALL updateLastVariables() [L117] last_1_var_1_12 = var_1_12 VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L127] RET updateLastVariables() [L128] CALL updateVariables() [L88] var_1_3 = __VERIFIER_nondet_char() [L89] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L89] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L90] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L90] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L91] var_1_4 = __VERIFIER_nondet_char() [L92] CALL assume_abort_if_not(var_1_4 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L92] RET assume_abort_if_not(var_1_4 >= -63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L93] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L93] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L94] var_1_6 = __VERIFIER_nondet_char() [L95] CALL assume_abort_if_not(var_1_6 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L95] RET assume_abort_if_not(var_1_6 >= -1) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L96] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L96] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L97] var_1_7 = __VERIFIER_nondet_char() [L98] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L98] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L99] CALL assume_abort_if_not(var_1_7 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L99] RET assume_abort_if_not(var_1_7 <= 127) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L100] var_1_10 = __VERIFIER_nondet_ushort() [L101] CALL assume_abort_if_not(var_1_10 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L101] RET assume_abort_if_not(var_1_10 >= 49150) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L102] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L102] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L103] var_1_11 = __VERIFIER_nondet_ushort() [L104] CALL assume_abort_if_not(var_1_11 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L104] RET assume_abort_if_not(var_1_11 >= 32767) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L105] CALL assume_abort_if_not(var_1_11 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L105] RET assume_abort_if_not(var_1_11 <= 65534) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L106] var_1_14 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L107] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L108] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L108] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L109] var_1_20 = __VERIFIER_nondet_short() [L110] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=194, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=194, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L110] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=194, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L111] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=194, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=194, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L111] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=194, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L112] var_1_21 = __VERIFIER_nondet_short() [L113] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L113] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L114] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L114] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L128] RET updateVariables() [L129] CALL step() [L43] signed char stepLocal_1 = var_1_6; [L44] unsigned char stepLocal_0 = last_1_var_1_12; VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_1=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L45] COND FALSE !(-25 == stepLocal_1) [L50] var_1_8 = ((((var_1_7) > (var_1_11)) ? (var_1_7) : (var_1_11))) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=49278] [L52] signed char stepLocal_2 = var_1_7; VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_2=127, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=49278] [L53] COND TRUE var_1_8 >= stepLocal_2 [L54] var_1_12 = (! var_1_14) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=49278] [L56] COND TRUE \read(var_1_12) [L57] var_1_1 = (var_1_3 + var_1_4) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=0, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=49278] [L59] COND TRUE var_1_4 >= (var_1_6 - var_1_7) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=0, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=49278] [L60] COND TRUE \read(var_1_12) [L61] var_1_5 = 8.25 VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=0, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=49278] [L64] signed char stepLocal_4 = var_1_6; VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_4=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=0, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=49278] [L65] COND TRUE var_1_1 < stepLocal_4 [L66] var_1_18 = (var_1_6 - var_1_7) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=-126, var_1_19=25, var_1_1=0, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=49278] [L70] COND TRUE \read(var_1_12) [L71] var_1_19 = ((var_1_7 - ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21)))) + var_1_6) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=-126, var_1_19=-66, var_1_1=0, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=49278] [L73] COND TRUE -64 > (var_1_6 + var_1_19) [L74] var_1_15 = (var_1_11 - var_1_7) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=-126, var_1_19=-66, var_1_1=0, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=49278] [L82] signed long int stepLocal_3 = ((((var_1_11) > (var_1_18)) ? (var_1_11) : (var_1_18))) + (var_1_15 / var_1_10); VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_3=49279, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=-126, var_1_19=-66, var_1_1=0, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=49278] [L83] COND FALSE !(var_1_19 > stepLocal_3) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=-126, var_1_19=-66, var_1_1=0, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=49278] [L129] RET step() [L130] CALL, EXPR property() [L120-L121] return (((((((var_1_12 ? (var_1_1 == ((signed char) (var_1_3 + var_1_4))) : 1) && ((var_1_4 >= (var_1_6 - var_1_7)) ? (var_1_12 ? (var_1_5 == ((double) 8.25)) : 1) : 1)) && ((-25 == var_1_6) ? ((last_1_var_1_12 && last_1_var_1_12) ? (var_1_8 == ((unsigned short int) ((((((var_1_10 - 10) - 16)) > ((var_1_11 - var_1_7))) ? (((var_1_10 - 10) - 16)) : ((var_1_11 - var_1_7)))))) : 1) : (var_1_8 == ((unsigned short int) ((((var_1_7) > (var_1_11)) ? (var_1_7) : (var_1_11))))))) && ((var_1_8 >= var_1_7) ? (var_1_12 == ((unsigned char) (! var_1_14))) : 1)) && ((-64 > (var_1_6 + var_1_19)) ? (var_1_15 == ((signed long int) (var_1_11 - var_1_7))) : ((! var_1_12) ? (var_1_12 ? (var_1_15 == ((signed long int) 4)) : 1) : 1))) && ((var_1_19 > (((((var_1_11) > (var_1_18)) ? (var_1_11) : (var_1_18))) + (var_1_15 / var_1_10))) ? (var_1_16 == ((signed short int) var_1_4)) : 1)) && ((var_1_1 < var_1_6) ? (var_1_18 == ((signed short int) (var_1_6 - var_1_7))) : (var_1_18 == ((signed short int) (((((var_1_6 + var_1_4)) < (var_1_1)) ? ((var_1_6 + var_1_4)) : (var_1_1))))))) && (var_1_12 ? (var_1_19 == ((signed short int) ((var_1_7 - ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21)))) + var_1_6))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=-126, var_1_19=-66, var_1_1=0, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=49278] [L130] RET, EXPR property() [L130] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=-126, var_1_19=-66, var_1_1=0, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=49278] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=-126, var_1_19=-66, var_1_1=0, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=49278] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.8s, OverallIterations: 11, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 1752 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1747 mSDsluCounter, 3898 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2965 mSDsCounter, 150 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3381 IncrementalHoareTripleChecker+Invalid, 3533 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 150 mSolverCounterUnsat, 933 mSDtfsCounter, 3381 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 598 GetRequests, 465 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 7.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=553occurred in iteration=10, InterpolantAutomatonStates: 133, 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, 10 MinimizatonAttempts, 650 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 17.8s InterpolantComputationTime, 1551 NumberOfCodeBlocks, 1551 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1181 ConstructedInterpolants, 1 QuantifiedInterpolants, 12305 SizeOfPredicates, 7 NumberOfNonLiveVariables, 289 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 6027/6120 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 08:57:03,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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_loopvsstraightlinecode_50-while_file-66.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 1cf6e6673b438699da9ee704d05513145f047cb3df96501a17b1bf1cde58831e --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:57:05,462 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:57:05,545 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 08:57:05,549 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:57:05,550 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:57:05,578 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:57:05,578 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:57:05,578 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:57:05,578 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:57:05,579 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:57:05,579 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:57:05,579 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:57:05,579 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:57:05,579 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:57:05,579 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:57:05,580 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:57:05,580 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:57:05,580 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:57:05,580 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:57:05,580 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:57:05,580 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:57:05,580 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:57:05,580 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:57:05,580 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 08:57:05,580 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 08:57:05,580 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:57:05,580 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 08:57:05,580 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:57:05,580 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:57:05,580 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:57:05,580 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:57:05,580 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:57:05,581 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:57:05,581 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:57:05,581 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:57:05,581 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:57:05,581 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:57:05,581 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:57:05,581 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 08:57:05,581 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 08:57:05,581 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:57:05,581 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:57:05,581 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:57:05,581 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:57:05,581 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 -> 1cf6e6673b438699da9ee704d05513145f047cb3df96501a17b1bf1cde58831e [2024-11-07 08:57:05,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:57:05,814 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:57:05,816 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:57:05,817 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:57:05,817 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:57:05,818 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-66.i [2024-11-07 08:57:06,946 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:57:07,134 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:57:07,135 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-66.i [2024-11-07 08:57:07,142 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/993aff6ee/f4d479202c1041c1ad521123186b19f7/FLAGab61b016c [2024-11-07 08:57:07,501 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/993aff6ee/f4d479202c1041c1ad521123186b19f7 [2024-11-07 08:57:07,503 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:57:07,504 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:57:07,505 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:57:07,505 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:57:07,512 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:57:07,513 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:57:07" (1/1) ... [2024-11-07 08:57:07,515 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57f2d695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:57:07, skipping insertion in model container [2024-11-07 08:57:07,515 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:57:07" (1/1) ... [2024-11-07 08:57:07,530 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:57:07,621 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-66.i[915,928] [2024-11-07 08:57:07,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:57:07,661 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:57:07,669 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-66.i[915,928] [2024-11-07 08:57:07,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:57:07,700 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:57:07,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:57:07 WrapperNode [2024-11-07 08:57:07,700 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:57:07,701 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:57:07,701 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:57:07,701 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:57:07,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:57:07" (1/1) ... [2024-11-07 08:57:07,713 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:57:07" (1/1) ... [2024-11-07 08:57:07,730 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 126 [2024-11-07 08:57:07,730 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:57:07,730 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:57:07,731 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:57:07,731 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:57:07,736 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:57:07" (1/1) ... [2024-11-07 08:57:07,736 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:57:07" (1/1) ... [2024-11-07 08:57:07,738 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:57:07" (1/1) ... [2024-11-07 08:57:07,746 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 08:57:07,746 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:57:07" (1/1) ... [2024-11-07 08:57:07,746 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:57:07" (1/1) ... [2024-11-07 08:57:07,751 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:57:07" (1/1) ... [2024-11-07 08:57:07,753 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:57:07" (1/1) ... [2024-11-07 08:57:07,754 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:57:07" (1/1) ... [2024-11-07 08:57:07,755 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:57:07" (1/1) ... [2024-11-07 08:57:07,756 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:57:07,757 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:57:07,757 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:57:07,757 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:57:07,760 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:57:07" (1/1) ... [2024-11-07 08:57:07,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:57:07,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:57:07,786 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 08:57:07,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 08:57:07,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:57:07,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 08:57:07,802 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:57:07,802 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:57:07,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:57:07,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:57:07,855 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:57:07,856 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:57:08,082 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-07 08:57:08,083 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:57:08,090 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:57:08,090 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:57:08,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:57:08 BoogieIcfgContainer [2024-11-07 08:57:08,091 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:57:08,094 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:57:08,094 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:57:08,098 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:57:08,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:57:07" (1/3) ... [2024-11-07 08:57:08,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26347f6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:57:08, skipping insertion in model container [2024-11-07 08:57:08,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:57:07" (2/3) ... [2024-11-07 08:57:08,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26347f6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:57:08, skipping insertion in model container [2024-11-07 08:57:08,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:57:08" (3/3) ... [2024-11-07 08:57:08,101 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-66.i [2024-11-07 08:57:08,131 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:57:08,131 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:57:08,173 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:57:08,183 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;@1bf4b047, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:57:08,184 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:57:08,187 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 08:57:08,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 08:57:08,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:57:08,196 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:57:08,197 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:57:08,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:57:08,202 INFO L85 PathProgramCache]: Analyzing trace with hash 38250463, now seen corresponding path program 1 times [2024-11-07 08:57:08,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:57:08,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1406616344] [2024-11-07 08:57:08,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:57:08,210 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 08:57:08,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:57:08,214 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 08:57:08,215 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 08:57:08,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:08,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-07 08:57:08,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:57:09,908 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 406 proven. 78 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-11-07 08:57:09,908 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:57:12,966 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:57:12,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1406616344] [2024-11-07 08:57:12,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1406616344] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:57:12,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1049821408] [2024-11-07 08:57:12,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:57:12,967 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 08:57:12,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 08:57:12,971 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 08:57:12,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (3)] Waiting until timeout for monitored process [2024-11-07 08:57:13,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:13,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-07 08:57:13,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:57:21,032 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 388 proven. 72 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-11-07 08:57:21,032 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:57:30,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1049821408] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:57:30,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 08:57:30,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2024-11-07 08:57:30,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723793971] [2024-11-07 08:57:30,715 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 08:57:30,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-07 08:57:30,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:57:30,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-07 08:57:30,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=650, Unknown=1, NotChecked=0, Total=756 [2024-11-07 08:57:30,734 INFO L87 Difference]: Start difference. First operand has 61 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 22 states, 22 states have (on average 3.772727272727273) internal successors, (83), 22 states have internal predecessors, (83), 7 states have call successors, (31), 7 states have call predecessors, (31), 12 states have return successors, (32), 7 states have call predecessors, (32), 7 states have call successors, (32) [2024-11-07 08:57:52,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]