./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-41.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_100-while_file-41.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', 'cefce1e082ba19bdab32bd25d6d8c4c5179b384e1b7a368e743da81f29016498'] 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_100-while_file-41.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 cefce1e082ba19bdab32bd25d6d8c4c5179b384e1b7a368e743da81f29016498 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:09:52,817 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:09:52,880 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:09:52,884 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:09:52,884 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:09:52,905 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:09:52,906 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:09:52,906 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:09:52,907 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:09:52,907 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:09:52,908 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:09:52,908 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:09:52,908 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:09:52,908 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:09:52,909 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:09:52,909 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:09:52,909 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:09:52,909 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:09:52,909 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 08:09:52,909 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:09:52,909 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:09:52,909 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:09:52,909 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:09:52,910 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:09:52,910 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:09:52,910 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:09:52,910 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:09:52,910 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:09:52,910 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:09:52,910 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:09:52,910 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:09:52,911 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:09:52,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:09:52,911 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:09:52,911 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:09:52,911 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:09:52,911 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 08:09:52,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 08:09:52,911 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:09:52,911 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:09:52,911 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:09:52,911 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:09:52,911 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 -> cefce1e082ba19bdab32bd25d6d8c4c5179b384e1b7a368e743da81f29016498 [2024-11-07 08:09:53,153 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:09:53,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:09:53,160 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:09:53,161 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:09:53,161 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:09:53,162 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-41.i [2024-11-07 08:09:54,265 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:09:54,477 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:09:54,481 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-41.i [2024-11-07 08:09:54,489 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aef3a1e9d/5ae9469f95d04558a217c539ce123849/FLAG16c833c37 [2024-11-07 08:09:54,505 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aef3a1e9d/5ae9469f95d04558a217c539ce123849 [2024-11-07 08:09:54,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:09:54,508 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:09:54,509 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:09:54,509 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:09:54,512 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:09:54,513 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:09:54" (1/1) ... [2024-11-07 08:09:54,513 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34bb3e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:09:54, skipping insertion in model container [2024-11-07 08:09:54,513 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:09:54" (1/1) ... [2024-11-07 08:09:54,526 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:09:54,632 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_100-while_file-41.i[916,929] [2024-11-07 08:09:54,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:09:54,733 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:09:54,741 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_100-while_file-41.i[916,929] [2024-11-07 08:09:54,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:09:54,807 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:09:54,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:09:54 WrapperNode [2024-11-07 08:09:54,808 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:09:54,809 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:09:54,810 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:09:54,810 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:09:54,814 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:09:54" (1/1) ... [2024-11-07 08:09:54,828 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:09:54" (1/1) ... [2024-11-07 08:09:54,876 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 238 [2024-11-07 08:09:54,876 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:09:54,877 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:09:54,877 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:09:54,878 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:09:54,885 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:09:54" (1/1) ... [2024-11-07 08:09:54,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:09:54" (1/1) ... [2024-11-07 08:09:54,893 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:09:54" (1/1) ... [2024-11-07 08:09:54,917 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:09:54,918 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:09:54" (1/1) ... [2024-11-07 08:09:54,918 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:09:54" (1/1) ... [2024-11-07 08:09:54,929 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:09:54" (1/1) ... [2024-11-07 08:09:54,931 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:09:54" (1/1) ... [2024-11-07 08:09:54,936 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:09:54" (1/1) ... [2024-11-07 08:09:54,938 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:09:54" (1/1) ... [2024-11-07 08:09:54,941 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:09:54,946 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:09:54,946 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:09:54,946 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:09:54,947 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:09:54" (1/1) ... [2024-11-07 08:09:54,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:09:54,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:09:54,973 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:09:54,979 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:09:54,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:09:54,993 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:09:54,994 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:09:54,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 08:09:54,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:09:54,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:09:55,075 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:09:55,077 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:09:55,473 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-07 08:09:55,474 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:09:55,484 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:09:55,486 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:09:55,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:09:55 BoogieIcfgContainer [2024-11-07 08:09:55,486 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:09:55,488 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:09:55,488 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:09:55,491 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:09:55,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:09:54" (1/3) ... [2024-11-07 08:09:55,492 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11cf8c7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:09:55, skipping insertion in model container [2024-11-07 08:09:55,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:09:54" (2/3) ... [2024-11-07 08:09:55,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11cf8c7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:09:55, skipping insertion in model container [2024-11-07 08:09:55,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:09:55" (3/3) ... [2024-11-07 08:09:55,494 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-41.i [2024-11-07 08:09:55,504 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:09:55,504 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:09:55,546 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:09:55,555 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;@3e441f27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:09:55,555 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:09:55,561 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 67 states have internal predecessors, (95), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 08:09:55,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-07 08:09:55,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:09:55,571 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:55,572 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:09:55,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:09:55,576 INFO L85 PathProgramCache]: Analyzing trace with hash 198294688, now seen corresponding path program 1 times [2024-11-07 08:09:55,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:09:55,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466383099] [2024-11-07 08:09:55,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:09:55,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:09:55,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:56,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:09:56,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:56,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:09:56,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:56,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:09:56,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:56,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:09:56,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:56,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:09:56,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:56,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:09:56,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:56,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:09:56,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:56,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:09:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:56,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:09:56,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:56,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:09:56,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:56,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:09:56,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:56,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:09:56,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:56,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:09:56,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:56,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:09:56,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:56,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:09:56,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:56,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:09:56,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:56,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 08:09:56,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:56,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 08:09:56,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:56,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 08:09:56,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:56,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 08:09:56,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:56,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 08:09:56,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:56,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 08:09:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:56,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 08:09:56,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:56,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 08:09:56,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:56,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 08:09:56,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:56,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-07 08:09:56,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:56,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 08:09:56,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:56,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 08:09:56,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:56,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 08:09:56,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:56,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-07 08:09:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:56,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 08:09:56,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:56,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-07 08:09:56,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:56,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 08:09:56,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:09:56,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466383099] [2024-11-07 08:09:56,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466383099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:09:56,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:09:56,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 08:09:56,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116135350] [2024-11-07 08:09:56,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:09:56,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 08:09:56,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:09:56,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 08:09:56,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:09:56,360 INFO L87 Difference]: Start difference. First operand has 101 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 67 states have internal predecessors, (95), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 08:09:56,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:09:56,745 INFO L93 Difference]: Finished difference Result 294 states and 537 transitions. [2024-11-07 08:09:56,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 08:09:56,747 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 206 [2024-11-07 08:09:56,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:09:56,755 INFO L225 Difference]: With dead ends: 294 [2024-11-07 08:09:56,756 INFO L226 Difference]: Without dead ends: 196 [2024-11-07 08:09:56,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 08:09:56,766 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 228 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 08:09:56,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 547 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 08:09:56,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-07 08:09:56,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 100. [2024-11-07 08:09:56,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 66 states have (on average 1.393939393939394) internal successors, (92), 66 states have internal predecessors, (92), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 08:09:56,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 156 transitions. [2024-11-07 08:09:56,829 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 156 transitions. Word has length 206 [2024-11-07 08:09:56,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:09:56,832 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 156 transitions. [2024-11-07 08:09:56,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 08:09:56,832 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 156 transitions. [2024-11-07 08:09:56,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-07 08:09:56,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:09:56,836 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:56,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 08:09:56,837 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:09:56,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:09:56,837 INFO L85 PathProgramCache]: Analyzing trace with hash 878353058, now seen corresponding path program 1 times [2024-11-07 08:09:56,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:09:56,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32847680] [2024-11-07 08:09:56,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:09:56,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:09:56,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:57,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:09:57,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:57,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:09:57,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:57,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:09:57,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:57,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:09:57,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:57,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:09:57,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:57,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:09:57,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:57,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:09:57,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:57,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:09:57,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:57,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:09:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:57,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:09:57,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:57,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:09:57,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:57,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:09:57,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:57,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:09:57,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:57,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:09:57,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:57,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:09:57,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:57,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:09:57,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:57,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 08:09:57,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:57,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 08:09:57,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:57,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 08:09:57,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:57,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 08:09:57,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:57,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 08:09:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:57,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 08:09:57,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:57,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 08:09:57,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:57,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 08:09:57,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:57,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 08:09:57,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:57,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-07 08:09:57,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:57,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 08:09:57,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:57,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 08:09:57,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:57,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 08:09:57,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:57,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-07 08:09:57,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:57,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 08:09:57,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:57,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-07 08:09:57,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:57,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 08:09:57,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:09:57,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32847680] [2024-11-07 08:09:57,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32847680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:09:57,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:09:57,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 08:09:57,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880625005] [2024-11-07 08:09:57,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:09:57,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 08:09:57,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:09:57,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 08:09:57,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:09:57,391 INFO L87 Difference]: Start difference. First operand 100 states and 156 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 08:09:57,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:09:57,458 INFO L93 Difference]: Finished difference Result 291 states and 458 transitions. [2024-11-07 08:09:57,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 08:09:57,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 206 [2024-11-07 08:09:57,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:09:57,463 INFO L225 Difference]: With dead ends: 291 [2024-11-07 08:09:57,464 INFO L226 Difference]: Without dead ends: 194 [2024-11-07 08:09:57,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 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:09:57,466 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 85 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:09:57,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 289 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:09:57,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-07 08:09:57,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2024-11-07 08:09:57,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 124 states have (on average 1.3870967741935485) internal successors, (172), 124 states have internal predecessors, (172), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 08:09:57,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 300 transitions. [2024-11-07 08:09:57,513 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 300 transitions. Word has length 206 [2024-11-07 08:09:57,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:09:57,514 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 300 transitions. [2024-11-07 08:09:57,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 08:09:57,514 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 300 transitions. [2024-11-07 08:09:57,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-07 08:09:57,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:09:57,519 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:57,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 08:09:57,520 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:09:57,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:09:57,520 INFO L85 PathProgramCache]: Analyzing trace with hash -823403552, now seen corresponding path program 1 times [2024-11-07 08:09:57,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:09:57,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062329904] [2024-11-07 08:09:57,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:09:57,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:09:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:07,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:10:07,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:07,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:10:07,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:07,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:10:07,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:07,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:10:07,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:07,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:10:07,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:07,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:10:07,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:07,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:10:07,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:07,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:10:07,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:07,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:10:07,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:07,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:10:07,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:07,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:10:07,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:07,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:10:07,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:07,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:10:07,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:07,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:10:07,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:07,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:10:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:07,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:10:07,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:07,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 08:10:07,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:07,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 08:10:07,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:07,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 08:10:07,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:07,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 08:10:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:07,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 08:10:07,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:07,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 08:10:07,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:07,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 08:10:07,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:07,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 08:10:07,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:07,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 08:10:07,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:07,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-07 08:10:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:07,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 08:10:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:07,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 08:10:07,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:07,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 08:10:07,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:07,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-07 08:10:07,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:07,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 08:10:07,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:07,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-07 08:10:07,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:07,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 08:10:07,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:10:07,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062329904] [2024-11-07 08:10:07,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062329904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:10:07,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:10:07,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 08:10:07,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275500445] [2024-11-07 08:10:07,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:10:07,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 08:10:07,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:10:07,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 08:10:07,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-07 08:10:07,250 INFO L87 Difference]: Start difference. First operand 191 states and 300 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 08:10:08,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:10:08,258 INFO L93 Difference]: Finished difference Result 650 states and 1004 transitions. [2024-11-07 08:10:08,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 08:10:08,259 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 206 [2024-11-07 08:10:08,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:10:08,262 INFO L225 Difference]: With dead ends: 650 [2024-11-07 08:10:08,262 INFO L226 Difference]: Without dead ends: 462 [2024-11-07 08:10:08,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2024-11-07 08:10:08,264 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 424 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 08:10:08,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 627 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 08:10:08,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-11-07 08:10:08,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 271. [2024-11-07 08:10:08,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 190 states have (on average 1.4157894736842105) internal successors, (269), 191 states have internal predecessors, (269), 76 states have call successors, (76), 4 states have call predecessors, (76), 4 states have return successors, (76), 75 states have call predecessors, (76), 76 states have call successors, (76) [2024-11-07 08:10:08,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 421 transitions. [2024-11-07 08:10:08,317 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 421 transitions. Word has length 206 [2024-11-07 08:10:08,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:10:08,318 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 421 transitions. [2024-11-07 08:10:08,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 08:10:08,319 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 421 transitions. [2024-11-07 08:10:08,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-07 08:10:08,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:10:08,321 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:08,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 08:10:08,321 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:10:08,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:10:08,322 INFO L85 PathProgramCache]: Analyzing trace with hash -604548834, now seen corresponding path program 1 times [2024-11-07 08:10:08,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:10:08,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112970124] [2024-11-07 08:10:08,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:10:08,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:10:08,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:10:08,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:10:08,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:10:08,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:10:08,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:10:08,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:10:08,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:10:08,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:10:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:10:08,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:10:08,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:10:08,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:10:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:10:08,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:10:08,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:10:08,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:10:08,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 08:10:08,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 08:10:08,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 08:10:08,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 08:10:08,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 08:10:08,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 08:10:08,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 08:10:08,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 08:10:08,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 08:10:08,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-07 08:10:08,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 08:10:08,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 08:10:08,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 08:10:08,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-07 08:10:08,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 08:10:08,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-07 08:10:08,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 08:10:08,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:10:08,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112970124] [2024-11-07 08:10:08,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112970124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:10:08,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:10:08,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 08:10:08,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267553802] [2024-11-07 08:10:08,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:10:08,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 08:10:08,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:10:08,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 08:10:08,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:10:08,479 INFO L87 Difference]: Start difference. First operand 271 states and 421 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 08:10:08,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:10:08,542 INFO L93 Difference]: Finished difference Result 695 states and 1071 transitions. [2024-11-07 08:10:08,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 08:10:08,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 206 [2024-11-07 08:10:08,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:10:08,548 INFO L225 Difference]: With dead ends: 695 [2024-11-07 08:10:08,548 INFO L226 Difference]: Without dead ends: 446 [2024-11-07 08:10:08,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 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:10:08,550 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 134 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:10:08,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 414 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:10:08,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-11-07 08:10:08,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 371. [2024-11-07 08:10:08,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 256 states have (on average 1.375) internal successors, (352), 258 states have internal predecessors, (352), 108 states have call successors, (108), 6 states have call predecessors, (108), 6 states have return successors, (108), 106 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-07 08:10:08,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 568 transitions. [2024-11-07 08:10:08,602 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 568 transitions. Word has length 206 [2024-11-07 08:10:08,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:10:08,603 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 568 transitions. [2024-11-07 08:10:08,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 08:10:08,604 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 568 transitions. [2024-11-07 08:10:08,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-07 08:10:08,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:10:08,605 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:08,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 08:10:08,606 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:10:08,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:10:08,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1625617188, now seen corresponding path program 1 times [2024-11-07 08:10:08,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:10:08,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836667524] [2024-11-07 08:10:08,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:10:08,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:10:08,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:10:08,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:10:08,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:10:08,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:10:08,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:10:08,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:10:08,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:10:08,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:10:08,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:10:08,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:10:08,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:10:08,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:10:08,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:10:08,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:10:08,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:10:08,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:10:08,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 08:10:08,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 08:10:08,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 08:10:08,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 08:10:08,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 08:10:08,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 08:10:08,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 08:10:08,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 08:10:08,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 08:10:08,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-07 08:10:08,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 08:10:08,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 08:10:08,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 08:10:08,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-07 08:10:08,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 08:10:08,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-07 08:10:08,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:08,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 08:10:08,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:10:08,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836667524] [2024-11-07 08:10:08,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836667524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:10:08,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:10:08,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 08:10:08,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428156200] [2024-11-07 08:10:08,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:10:08,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 08:10:08,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:10:08,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 08:10:08,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 08:10:08,913 INFO L87 Difference]: Start difference. First operand 371 states and 568 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 08:10:09,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:10:09,000 INFO L93 Difference]: Finished difference Result 770 states and 1176 transitions. [2024-11-07 08:10:09,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 08:10:09,001 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 206 [2024-11-07 08:10:09,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:10:09,004 INFO L225 Difference]: With dead ends: 770 [2024-11-07 08:10:09,005 INFO L226 Difference]: Without dead ends: 421 [2024-11-07 08:10:09,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 08:10:09,008 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 115 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 08:10:09,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 385 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 08:10:09,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-07 08:10:09,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 371. [2024-11-07 08:10:09,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 256 states have (on average 1.3671875) internal successors, (350), 258 states have internal predecessors, (350), 108 states have call successors, (108), 6 states have call predecessors, (108), 6 states have return successors, (108), 106 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-07 08:10:09,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 566 transitions. [2024-11-07 08:10:09,047 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 566 transitions. Word has length 206 [2024-11-07 08:10:09,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:10:09,049 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 566 transitions. [2024-11-07 08:10:09,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 08:10:09,049 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 566 transitions. [2024-11-07 08:10:09,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-07 08:10:09,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:10:09,050 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:09,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 08:10:09,050 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:10:09,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:10:09,051 INFO L85 PathProgramCache]: Analyzing trace with hash 2093744881, now seen corresponding path program 1 times [2024-11-07 08:10:09,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:10:09,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308345461] [2024-11-07 08:10:09,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:10:09,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:10:09,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:10:09,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:10:09,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:10:09,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:10:09,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:10:09,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:10:09,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:10:09,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:10:09,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:10:09,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:10:09,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:10:09,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:10:09,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:10:09,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:10:09,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:10:09,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:10:09,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 08:10:09,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 08:10:09,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 08:10:09,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 08:10:09,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 08:10:09,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 08:10:09,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 08:10:09,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 08:10:09,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 08:10:09,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-07 08:10:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 08:10:09,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 08:10:09,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 08:10:09,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-07 08:10:09,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 08:10:09,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-07 08:10:09,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 08:10:09,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:10:09,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308345461] [2024-11-07 08:10:09,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308345461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:10:09,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:10:09,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 08:10:09,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989689375] [2024-11-07 08:10:09,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:10:09,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 08:10:09,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:10:09,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 08:10:09,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:10:09,371 INFO L87 Difference]: Start difference. First operand 371 states and 566 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 08:10:09,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:10:09,454 INFO L93 Difference]: Finished difference Result 800 states and 1215 transitions. [2024-11-07 08:10:09,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 08:10:09,455 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 207 [2024-11-07 08:10:09,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:10:09,458 INFO L225 Difference]: With dead ends: 800 [2024-11-07 08:10:09,458 INFO L226 Difference]: Without dead ends: 438 [2024-11-07 08:10:09,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:10:09,461 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 332 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 08:10:09,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 306 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 08:10:09,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-11-07 08:10:09,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 373. [2024-11-07 08:10:09,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 258 states have (on average 1.3565891472868217) internal successors, (350), 260 states have internal predecessors, (350), 108 states have call successors, (108), 6 states have call predecessors, (108), 6 states have return successors, (108), 106 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-07 08:10:09,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 566 transitions. [2024-11-07 08:10:09,511 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 566 transitions. Word has length 207 [2024-11-07 08:10:09,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:10:09,512 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 566 transitions. [2024-11-07 08:10:09,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 08:10:09,512 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 566 transitions. [2024-11-07 08:10:09,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-07 08:10:09,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:10:09,514 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:09,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 08:10:09,515 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:10:09,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:10:09,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1867532374, now seen corresponding path program 1 times [2024-11-07 08:10:09,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:10:09,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659195840] [2024-11-07 08:10:09,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:10:09,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:10:09,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:10:09,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:10:09,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:10:09,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:10:09,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:10:09,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:10:09,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:10:09,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:10:09,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:10:09,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:10:09,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:10:09,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:10:09,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:10:09,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:10:09,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:10:09,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:10:09,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 08:10:09,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 08:10:09,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 08:10:09,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 08:10:09,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 08:10:09,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 08:10:09,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 08:10:09,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 08:10:09,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 08:10:09,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-07 08:10:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 08:10:09,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 08:10:09,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 08:10:09,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-07 08:10:09,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 08:10:09,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-07 08:10:09,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:09,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 08:10:09,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:10:09,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659195840] [2024-11-07 08:10:09,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659195840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:10:09,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:10:09,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 08:10:09,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260794020] [2024-11-07 08:10:09,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:10:09,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 08:10:09,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:10:09,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 08:10:09,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 08:10:09,783 INFO L87 Difference]: Start difference. First operand 373 states and 566 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 08:10:09,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:10:09,849 INFO L93 Difference]: Finished difference Result 597 states and 905 transitions. [2024-11-07 08:10:09,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 08:10:09,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 207 [2024-11-07 08:10:09,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:10:09,853 INFO L225 Difference]: With dead ends: 597 [2024-11-07 08:10:09,853 INFO L226 Difference]: Without dead ends: 452 [2024-11-07 08:10:09,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:10:09,854 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 104 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:10:09,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 453 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:10:09,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2024-11-07 08:10:09,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 382. [2024-11-07 08:10:09,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 267 states have (on average 1.3595505617977528) internal successors, (363), 269 states have internal predecessors, (363), 108 states have call successors, (108), 6 states have call predecessors, (108), 6 states have return successors, (108), 106 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-07 08:10:09,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 579 transitions. [2024-11-07 08:10:09,893 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 579 transitions. Word has length 207 [2024-11-07 08:10:09,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:10:09,893 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 579 transitions. [2024-11-07 08:10:09,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 08:10:09,893 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 579 transitions. [2024-11-07 08:10:09,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-07 08:10:09,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:10:09,895 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:09,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 08:10:09,895 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:10:09,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:10:09,895 INFO L85 PathProgramCache]: Analyzing trace with hash 725678312, now seen corresponding path program 1 times [2024-11-07 08:10:09,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:10:09,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735753961] [2024-11-07 08:10:09,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:10:09,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:10:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:17,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:10:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:17,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:10:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:17,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:10:17,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:17,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:10:17,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:17,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:10:17,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:17,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:10:17,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:17,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:10:17,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:17,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:10:17,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:17,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:10:17,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:17,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:10:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:17,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:10:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:17,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:10:17,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:17,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:10:17,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:17,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:10:17,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:17,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:10:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:17,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:10:17,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:17,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 08:10:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:17,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 08:10:17,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:17,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 08:10:17,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:17,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 08:10:17,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:17,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 08:10:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:17,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 08:10:17,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:17,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 08:10:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:17,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 08:10:17,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:17,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 08:10:17,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:17,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-07 08:10:17,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:17,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 08:10:17,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:17,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 08:10:17,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:17,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 08:10:17,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:17,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-07 08:10:17,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:17,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 08:10:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:17,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-07 08:10:17,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:17,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 08:10:17,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:10:17,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735753961] [2024-11-07 08:10:17,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735753961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:10:17,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:10:17,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 08:10:17,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683414884] [2024-11-07 08:10:17,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:10:17,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 08:10:17,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:10:17,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 08:10:17,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2024-11-07 08:10:17,978 INFO L87 Difference]: Start difference. First operand 382 states and 579 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 08:10:18,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:10:18,971 INFO L93 Difference]: Finished difference Result 670 states and 1003 transitions. [2024-11-07 08:10:18,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 08:10:18,972 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 207 [2024-11-07 08:10:18,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:10:18,975 INFO L225 Difference]: With dead ends: 670 [2024-11-07 08:10:18,975 INFO L226 Difference]: Without dead ends: 516 [2024-11-07 08:10:18,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2024-11-07 08:10:18,976 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 329 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 08:10:18,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 759 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 08:10:18,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-11-07 08:10:19,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 376. [2024-11-07 08:10:19,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 261 states have (on average 1.3524904214559388) internal successors, (353), 263 states have internal predecessors, (353), 108 states have call successors, (108), 6 states have call predecessors, (108), 6 states have return successors, (108), 106 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-07 08:10:19,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 569 transitions. [2024-11-07 08:10:19,012 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 569 transitions. Word has length 207 [2024-11-07 08:10:19,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:10:19,012 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 569 transitions. [2024-11-07 08:10:19,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 08:10:19,012 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 569 transitions. [2024-11-07 08:10:19,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-07 08:10:19,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:10:19,015 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:19,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 08:10:19,015 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:10:19,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:10:19,015 INFO L85 PathProgramCache]: Analyzing trace with hash 811821820, now seen corresponding path program 1 times [2024-11-07 08:10:19,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:10:19,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550674258] [2024-11-07 08:10:19,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:10:19,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:10:19,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:35,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:10:35,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:35,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:10:35,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:35,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:10:35,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:35,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:10:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:35,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:10:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:35,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:10:35,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:35,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:10:35,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:35,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:10:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:35,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:10:35,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:35,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:10:35,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:35,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:10:35,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:35,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:10:35,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:35,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:10:35,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:35,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:10:35,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:35,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:10:35,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:35,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:10:35,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:35,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 08:10:35,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:35,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 08:10:35,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:35,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 08:10:35,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:35,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 08:10:35,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:35,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 08:10:35,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:35,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 08:10:35,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:35,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 08:10:35,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:35,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 08:10:35,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:35,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 08:10:35,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:35,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-07 08:10:35,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:35,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 08:10:35,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:35,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 08:10:35,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:35,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 08:10:35,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:35,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-07 08:10:35,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:35,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 08:10:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:35,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-07 08:10:35,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:35,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 08:10:35,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:10:35,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550674258] [2024-11-07 08:10:35,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550674258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:10:35,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:10:35,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 08:10:35,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022535000] [2024-11-07 08:10:35,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:10:35,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 08:10:35,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:10:35,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 08:10:35,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2024-11-07 08:10:35,314 INFO L87 Difference]: Start difference. First operand 376 states and 569 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 08:10:36,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:10:36,661 INFO L93 Difference]: Finished difference Result 860 states and 1287 transitions. [2024-11-07 08:10:36,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 08:10:36,663 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 207 [2024-11-07 08:10:36,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:10:36,666 INFO L225 Difference]: With dead ends: 860 [2024-11-07 08:10:36,666 INFO L226 Difference]: Without dead ends: 506 [2024-11-07 08:10:36,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2024-11-07 08:10:36,669 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 361 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:10:36,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 872 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 08:10:36,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2024-11-07 08:10:36,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 378. [2024-11-07 08:10:36,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 263 states have (on average 1.3574144486692015) internal successors, (357), 265 states have internal predecessors, (357), 108 states have call successors, (108), 6 states have call predecessors, (108), 6 states have return successors, (108), 106 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-07 08:10:36,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 573 transitions. [2024-11-07 08:10:36,708 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 573 transitions. Word has length 207 [2024-11-07 08:10:36,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:10:36,708 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 573 transitions. [2024-11-07 08:10:36,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 08:10:36,708 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 573 transitions. [2024-11-07 08:10:36,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-07 08:10:36,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:10:36,712 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:36,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 08:10:36,712 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:10:36,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:10:36,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1982367697, now seen corresponding path program 1 times [2024-11-07 08:10:36,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:10:36,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546206100] [2024-11-07 08:10:36,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:10:36,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:10:36,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:36,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:10:36,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:36,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:10:36,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:36,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:10:36,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:36,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:10:36,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:36,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:10:36,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:36,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:10:36,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:36,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:10:36,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:36,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:10:36,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:36,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:10:36,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:36,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:10:36,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:36,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:10:36,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:36,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:10:36,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:36,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:10:36,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:36,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:10:36,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:36,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:10:36,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:36,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:10:36,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:36,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 08:10:36,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:36,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 08:10:36,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:36,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 08:10:36,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:36,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 08:10:36,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:36,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 08:10:36,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:36,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 08:10:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:36,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 08:10:36,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:36,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 08:10:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:36,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 08:10:36,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:36,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-07 08:10:36,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:36,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 08:10:36,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:36,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 08:10:36,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:36,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 08:10:36,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:36,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-07 08:10:36,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:36,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 08:10:36,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:36,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-07 08:10:36,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:36,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 3 proven. 90 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-07 08:10:36,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:10:36,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546206100] [2024-11-07 08:10:36,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546206100] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:10:36,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528553604] [2024-11-07 08:10:36,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:10:36,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:10:36,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:10:36,980 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:10:36,982 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:10:37,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:37,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 08:10:37,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:10:37,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 153 proven. 90 refuted. 0 times theorem prover too weak. 1741 trivial. 0 not checked. [2024-11-07 08:10:37,413 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:10:37,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 3 proven. 90 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-07 08:10:37,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528553604] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 08:10:37,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 08:10:37,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-07 08:10:37,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788290031] [2024-11-07 08:10:37,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 08:10:37,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 08:10:37,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:10:37,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 08:10:37,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 08:10:37,624 INFO L87 Difference]: Start difference. First operand 378 states and 573 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2024-11-07 08:10:37,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:10:37,818 INFO L93 Difference]: Finished difference Result 619 states and 922 transitions. [2024-11-07 08:10:37,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 08:10:37,819 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) Word has length 207 [2024-11-07 08:10:37,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:10:37,821 INFO L225 Difference]: With dead ends: 619 [2024-11-07 08:10:37,821 INFO L226 Difference]: Without dead ends: 259 [2024-11-07 08:10:37,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 474 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-07 08:10:37,823 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 115 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 08:10:37,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 263 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 08:10:37,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-11-07 08:10:37,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 247. [2024-11-07 08:10:37,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 163 states have (on average 1.294478527607362) internal successors, (211), 164 states have internal predecessors, (211), 76 states have call successors, (76), 7 states have call predecessors, (76), 7 states have return successors, (76), 75 states have call predecessors, (76), 76 states have call successors, (76) [2024-11-07 08:10:37,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 363 transitions. [2024-11-07 08:10:37,845 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 363 transitions. Word has length 207 [2024-11-07 08:10:37,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:10:37,846 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 363 transitions. [2024-11-07 08:10:37,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2024-11-07 08:10:37,846 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 363 transitions. [2024-11-07 08:10:37,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-07 08:10:37,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:10:37,847 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:37,863 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:10:38,047 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:10:38,048 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:10:38,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:10:38,049 INFO L85 PathProgramCache]: Analyzing trace with hash -2136677189, now seen corresponding path program 1 times [2024-11-07 08:10:38,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:10:38,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711009879] [2024-11-07 08:10:38,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:10:38,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:10:38,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:38,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:10:38,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:38,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:10:38,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:38,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:10:38,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:38,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:10:38,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:38,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:10:38,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:38,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:10:38,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:38,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:10:38,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:38,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:10:38,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:38,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:10:38,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:38,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:10:38,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:38,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:10:38,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:38,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:10:38,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:38,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:10:38,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:38,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:10:38,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:38,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:10:38,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:38,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:10:38,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:38,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 08:10:38,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:38,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 08:10:38,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:38,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 08:10:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:38,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 08:10:38,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:38,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 08:10:38,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:38,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 08:10:38,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:38,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 08:10:38,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:38,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 08:10:38,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:38,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 08:10:38,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:38,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-07 08:10:38,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:38,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 08:10:38,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:38,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 08:10:38,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:38,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 08:10:38,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:38,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-07 08:10:38,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:38,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 08:10:38,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:38,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-07 08:10:38,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:38,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 45 proven. 48 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-07 08:10:38,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:10:38,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711009879] [2024-11-07 08:10:38,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711009879] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:10:38,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069630930] [2024-11-07 08:10:38,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:10:38,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:10:38,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:10:38,296 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:10:38,298 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:10:38,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:38,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 08:10:38,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:10:38,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1021 proven. 48 refuted. 0 times theorem prover too weak. 915 trivial. 0 not checked. [2024-11-07 08:10:38,588 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:10:38,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 45 proven. 48 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-07 08:10:38,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069630930] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 08:10:38,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 08:10:38,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-07 08:10:38,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112033030] [2024-11-07 08:10:38,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 08:10:38,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 08:10:38,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:10:38,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 08:10:38,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 08:10:38,781 INFO L87 Difference]: Start difference. First operand 247 states and 363 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2024-11-07 08:10:38,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:10:38,987 INFO L93 Difference]: Finished difference Result 490 states and 709 transitions. [2024-11-07 08:10:38,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 08:10:38,988 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) Word has length 208 [2024-11-07 08:10:38,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:10:38,990 INFO L225 Difference]: With dead ends: 490 [2024-11-07 08:10:38,990 INFO L226 Difference]: Without dead ends: 269 [2024-11-07 08:10:38,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 476 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-07 08:10:38,991 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 142 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 08:10:38,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 259 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 08:10:38,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-07 08:10:39,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 255. [2024-11-07 08:10:39,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 169 states have (on average 1.272189349112426) internal successors, (215), 170 states have internal predecessors, (215), 76 states have call successors, (76), 9 states have call predecessors, (76), 9 states have return successors, (76), 75 states have call predecessors, (76), 76 states have call successors, (76) [2024-11-07 08:10:39,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 367 transitions. [2024-11-07 08:10:39,015 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 367 transitions. Word has length 208 [2024-11-07 08:10:39,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:10:39,015 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 367 transitions. [2024-11-07 08:10:39,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2024-11-07 08:10:39,016 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 367 transitions. [2024-11-07 08:10:39,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-07 08:10:39,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:10:39,018 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:39,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 08:10:39,218 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:10:39,219 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:10:39,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:10:39,219 INFO L85 PathProgramCache]: Analyzing trace with hash 352851773, now seen corresponding path program 1 times [2024-11-07 08:10:39,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:10:39,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788169234] [2024-11-07 08:10:39,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:10:39,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:10:39,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 08:10:39,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [796380005] [2024-11-07 08:10:39,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:10:39,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:10:39,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:10:39,307 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 08:10:39,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 08:10:39,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 08:10:39,430 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 08:10:39,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 08:10:39,590 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 08:10:39,590 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 08:10:39,591 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 08:10:39,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 08:10:39,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:10:39,795 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:10:39,900 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 08:10:39,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:10:39 BoogieIcfgContainer [2024-11-07 08:10:39,905 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 08:10:39,906 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 08:10:39,906 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 08:10:39,906 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 08:10:39,907 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:09:55" (3/4) ... [2024-11-07 08:10:39,908 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 08:10:39,909 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 08:10:39,910 INFO L158 Benchmark]: Toolchain (without parser) took 45401.01ms. Allocated memory was 117.4MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 93.8MB in the beginning and 758.8MB in the end (delta: -665.0MB). Peak memory consumption was 416.2MB. Max. memory is 16.1GB. [2024-11-07 08:10:39,910 INFO L158 Benchmark]: CDTParser took 0.55ms. Allocated memory is still 83.9MB. Free memory is still 47.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:10:39,910 INFO L158 Benchmark]: CACSL2BoogieTranslator took 299.25ms. Allocated memory is still 117.4MB. Free memory was 93.6MB in the beginning and 76.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 08:10:39,910 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.95ms. Allocated memory is still 117.4MB. Free memory was 76.8MB in the beginning and 72.1MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:10:39,910 INFO L158 Benchmark]: Boogie Preprocessor took 64.37ms. Allocated memory is still 117.4MB. Free memory was 72.1MB in the beginning and 64.7MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:10:39,912 INFO L158 Benchmark]: RCFGBuilder took 540.56ms. Allocated memory is still 117.4MB. Free memory was 64.7MB in the beginning and 87.1MB in the end (delta: -22.4MB). Peak memory consumption was 39.5MB. Max. memory is 16.1GB. [2024-11-07 08:10:39,912 INFO L158 Benchmark]: TraceAbstraction took 44417.51ms. Allocated memory was 117.4MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 86.5MB in the beginning and 763.3MB in the end (delta: -676.7MB). Peak memory consumption was 401.9MB. Max. memory is 16.1GB. [2024-11-07 08:10:39,912 INFO L158 Benchmark]: Witness Printer took 3.03ms. Allocated memory is still 1.2GB. Free memory was 763.3MB in the beginning and 758.8MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:10:39,913 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.55ms. Allocated memory is still 83.9MB. Free memory is still 47.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 299.25ms. Allocated memory is still 117.4MB. Free memory was 93.6MB in the beginning and 76.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.95ms. Allocated memory is still 117.4MB. Free memory was 76.8MB in the beginning and 72.1MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 64.37ms. Allocated memory is still 117.4MB. Free memory was 72.1MB in the beginning and 64.7MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 540.56ms. Allocated memory is still 117.4MB. Free memory was 64.7MB in the beginning and 87.1MB in the end (delta: -22.4MB). Peak memory consumption was 39.5MB. Max. memory is 16.1GB. * TraceAbstraction took 44417.51ms. Allocated memory was 117.4MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 86.5MB in the beginning and 763.3MB in the end (delta: -676.7MB). Peak memory consumption was 401.9MB. Max. memory is 16.1GB. * Witness Printer took 3.03ms. Allocated memory is still 1.2GB. Free memory was 763.3MB in the beginning and 758.8MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. 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 someBinaryFLOATComparisonOperation at line 191, overapproximation of someBinaryDOUBLEComparisonOperation at line 191, overapproximation of someBinaryArithmeticFLOAToperation at line 61. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 100000; [L23] unsigned char var_1_7 = 0; [L24] unsigned char var_1_9 = 0; [L25] unsigned char var_1_10 = 1; [L26] signed char var_1_11 = -8; [L27] signed char var_1_12 = -50; [L28] signed char var_1_13 = 25; [L29] signed char var_1_14 = 100; [L30] signed char var_1_15 = 32; [L31] signed char var_1_16 = 25; [L32] signed long int var_1_17 = 50; [L33] signed long int var_1_18 = -32; [L34] signed short int var_1_19 = 256; [L35] unsigned long int var_1_20 = 64; [L36] unsigned char var_1_21 = 1; [L37] unsigned char var_1_22 = 0; [L38] float var_1_23 = 1.4; [L39] float var_1_24 = 3.875; [L40] float var_1_25 = 255.375; [L41] float var_1_26 = 0.65; [L42] float var_1_27 = 64.75; [L43] float var_1_28 = 3.5; [L44] signed long int var_1_29 = 16; [L45] unsigned char var_1_31 = 5; [L46] unsigned char var_1_32 = 128; [L47] unsigned char var_1_33 = 64; [L48] unsigned char var_1_34 = 2; [L49] signed short int var_1_35 = -128; [L50] signed short int var_1_36 = 19851; [L51] signed short int var_1_37 = 28837; [L52] float var_1_38 = 31.2; [L53] float var_1_39 = 127.6; [L54] unsigned long int last_1_var_1_20 = 64; VAL [isInitial=0, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L195] isInitial = 1 [L196] FCALL initially() [L197] COND TRUE 1 [L198] CALL updateLastVariables() [L188] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L198] RET updateLastVariables() [L199] CALL updateVariables() [L135] var_1_9 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0] [L136] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0] [L137] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L137] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L138] var_1_10 = __VERIFIER_nondet_uchar() [L139] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L139] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L140] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L140] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L141] var_1_12 = __VERIFIER_nondet_char() [L142] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L142] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L143] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L143] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L144] var_1_13 = __VERIFIER_nondet_char() [L145] CALL assume_abort_if_not(var_1_13 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L145] RET assume_abort_if_not(var_1_13 >= -127) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L146] CALL assume_abort_if_not(var_1_13 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L146] RET assume_abort_if_not(var_1_13 <= 126) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L147] var_1_14 = __VERIFIER_nondet_char() [L148] CALL assume_abort_if_not(var_1_14 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L148] RET assume_abort_if_not(var_1_14 >= -127) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L149] CALL assume_abort_if_not(var_1_14 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L149] RET assume_abort_if_not(var_1_14 <= 126) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L150] var_1_15 = __VERIFIER_nondet_char() [L151] CALL assume_abort_if_not(var_1_15 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L151] RET assume_abort_if_not(var_1_15 >= -1) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L152] CALL assume_abort_if_not(var_1_15 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L152] RET assume_abort_if_not(var_1_15 <= 126) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L153] var_1_16 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L154] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L155] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L155] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L156] var_1_22 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L157] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L158] CALL assume_abort_if_not(var_1_22 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L158] RET assume_abort_if_not(var_1_22 <= 0) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L159] var_1_24 = __VERIFIER_nondet_float() [L160] CALL assume_abort_if_not((var_1_24 >= -230584.3009213691390e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 2305843.009213691390e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L160] RET assume_abort_if_not((var_1_24 >= -230584.3009213691390e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 2305843.009213691390e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L161] var_1_25 = __VERIFIER_nondet_float() [L162] CALL assume_abort_if_not((var_1_25 >= -230584.3009213691390e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 2305843.009213691390e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L162] RET assume_abort_if_not((var_1_25 >= -230584.3009213691390e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 2305843.009213691390e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L163] var_1_26 = __VERIFIER_nondet_float() [L164] CALL assume_abort_if_not((var_1_26 >= -461168.6018427382800e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L164] RET assume_abort_if_not((var_1_26 >= -461168.6018427382800e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L165] var_1_27 = __VERIFIER_nondet_float() [L166] CALL assume_abort_if_not((var_1_27 >= -461168.6018427382800e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 4611686.018427382800e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L166] RET assume_abort_if_not((var_1_27 >= -461168.6018427382800e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 4611686.018427382800e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L167] var_1_28 = __VERIFIER_nondet_float() [L168] CALL assume_abort_if_not((var_1_28 >= -461168.6018427382800e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 4611686.018427382800e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L168] RET assume_abort_if_not((var_1_28 >= -461168.6018427382800e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 4611686.018427382800e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L169] var_1_32 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_32 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L170] RET assume_abort_if_not(var_1_32 >= 127) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L171] CALL assume_abort_if_not(var_1_32 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L171] RET assume_abort_if_not(var_1_32 <= 254) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L172] var_1_33 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_33 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L173] RET assume_abort_if_not(var_1_33 >= 63) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L174] CALL assume_abort_if_not(var_1_33 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L174] RET assume_abort_if_not(var_1_33 <= 127) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L175] var_1_34 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L176] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L177] CALL assume_abort_if_not(var_1_34 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L177] RET assume_abort_if_not(var_1_34 <= 63) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L178] var_1_36 = __VERIFIER_nondet_short() [L179] CALL assume_abort_if_not(var_1_36 >= 16382) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L179] RET assume_abort_if_not(var_1_36 >= 16382) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L180] CALL assume_abort_if_not(var_1_36 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L180] RET assume_abort_if_not(var_1_36 <= 32766) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L181] var_1_37 = __VERIFIER_nondet_short() [L182] CALL assume_abort_if_not(var_1_37 >= 16382) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L182] RET assume_abort_if_not(var_1_37 >= 16382) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L183] CALL assume_abort_if_not(var_1_37 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L183] RET assume_abort_if_not(var_1_37 <= 32766) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L184] var_1_39 = __VERIFIER_nondet_float() [L185] CALL assume_abort_if_not((var_1_39 >= -461168.6018427382800e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 4611686.018427382800e+12F && var_1_39 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=156/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=156/5, var_1_7=0, var_1_9=0] [L185] RET assume_abort_if_not((var_1_39 >= -461168.6018427382800e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 4611686.018427382800e+12F && var_1_39 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=156/5, var_1_7=0, var_1_9=0] [L199] RET updateVariables() [L200] CALL step() [L58] var_1_17 = ((((4) < (((1807938565 - 128) - var_1_16))) ? (4) : (((1807938565 - 128) - var_1_16)))) [L59] var_1_21 = (! (var_1_9 && var_1_22)) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=156/5, var_1_7=0, var_1_9=0] [L60] COND TRUE \read(var_1_21) [L61] var_1_23 = ((var_1_24 + var_1_25) + ((((var_1_26) < (((((var_1_27) < (var_1_28)) ? (var_1_27) : (var_1_28))))) ? (var_1_26) : (((((var_1_27) < (var_1_28)) ? (var_1_27) : (var_1_28))))))) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=156/5, var_1_7=0, var_1_9=0] [L63] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=156/5, var_1_7=0, var_1_9=0] [L66] COND FALSE !(\read(var_1_9)) [L73] var_1_38 = var_1_25 VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L75] COND FALSE !((- var_1_23) == var_1_23) [L78] var_1_1 = var_1_31 VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=-32, var_1_19=256, var_1_1=5, var_1_20=64, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L80] unsigned char stepLocal_0 = var_1_17 < var_1_31; VAL [isInitial=1, last_1_var_1_20=64, stepLocal_0=1, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=-32, var_1_19=256, var_1_1=5, var_1_20=64, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L81] COND FALSE !((127.35 + var_1_23) <= var_1_23) VAL [isInitial=1, last_1_var_1_20=64, stepLocal_0=1, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=-32, var_1_19=256, var_1_1=5, var_1_20=64, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L88] COND TRUE \read(var_1_21) [L89] var_1_11 = ((((var_1_12) < (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14))))) ? (var_1_12) : (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))))) VAL [isInitial=1, last_1_var_1_20=64, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=-32, var_1_19=256, var_1_1=5, var_1_20=64, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L93] COND FALSE !(\read(var_1_7)) [L96] var_1_18 = (var_1_15 + var_1_14) VAL [isInitial=1, last_1_var_1_20=64, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=6, var_1_19=256, var_1_1=5, var_1_20=64, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L98] EXPR ((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))) ^ var_1_18 VAL [isInitial=1, last_1_var_1_20=64, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=6, var_1_19=256, var_1_1=5, var_1_20=64, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L98] COND FALSE !(last_1_var_1_20 <= (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))) ^ var_1_18)) [L101] var_1_20 = var_1_31 VAL [isInitial=1, last_1_var_1_20=64, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=6, var_1_19=256, var_1_1=5, var_1_20=5, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L103] COND FALSE !(\read(var_1_7)) [L106] var_1_29 = ((((((var_1_16 + var_1_15) + -16)) > (((((var_1_14) < (((((var_1_31) < (var_1_18)) ? (var_1_31) : (var_1_18))))) ? (var_1_14) : (((((var_1_31) < (var_1_18)) ? (var_1_31) : (var_1_18)))))))) ? (((var_1_16 + var_1_15) + -16)) : (((((var_1_14) < (((((var_1_31) < (var_1_18)) ? (var_1_31) : (var_1_18))))) ? (var_1_14) : (((((var_1_31) < (var_1_18)) ? (var_1_31) : (var_1_18))))))))) VAL [isInitial=1, last_1_var_1_20=64, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=6, var_1_19=256, var_1_1=5, var_1_20=5, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=5, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L108] unsigned char stepLocal_5 = (var_1_17 / var_1_32) > ((((var_1_31) > (var_1_33)) ? (var_1_31) : (var_1_33))); [L109] signed long int stepLocal_4 = var_1_29; VAL [isInitial=1, last_1_var_1_20=64, stepLocal_0=1, stepLocal_4=5, stepLocal_5=0, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=6, var_1_19=256, var_1_1=5, var_1_20=5, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=5, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L110] COND FALSE !(stepLocal_5 && var_1_21) VAL [isInitial=1, last_1_var_1_20=64, stepLocal_0=1, stepLocal_4=5, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=6, var_1_19=256, var_1_1=5, var_1_20=5, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=5, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L115] COND TRUE var_1_31 == stepLocal_4 [L116] var_1_35 = ((((var_1_32) < 0 ) ? -(var_1_32) : (var_1_32))) VAL [isInitial=1, last_1_var_1_20=64, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=6, var_1_19=256, var_1_1=5, var_1_20=5, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=5, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=127, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L121] signed long int stepLocal_3 = var_1_17; [L122] unsigned char stepLocal_2 = var_1_10; [L123] signed short int stepLocal_1 = var_1_35; VAL [isInitial=1, last_1_var_1_20=64, stepLocal_0=1, stepLocal_1=127, stepLocal_2=1, stepLocal_3=4, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=6, var_1_19=256, var_1_1=5, var_1_20=5, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=5, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=127, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L124] COND FALSE !((var_1_15 + var_1_17) == stepLocal_1) [L131] var_1_19 = ((((var_1_13) < (128)) ? (var_1_13) : (128))) VAL [isInitial=1, last_1_var_1_20=64, stepLocal_0=1, stepLocal_2=1, stepLocal_3=4, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=6, var_1_19=0, var_1_1=5, var_1_20=5, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=5, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=127, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L200] RET step() [L201] CALL, EXPR property() [L191] EXPR ((((((((- var_1_23) == var_1_23) ? (var_1_1 == ((unsigned long int) (((((var_1_31 + var_1_31)) < (var_1_31)) ? ((var_1_31 + var_1_31)) : (var_1_31))))) : (var_1_1 == ((unsigned long int) var_1_31))) && (((127.35 + var_1_23) <= var_1_23) ? (((var_1_17 < var_1_31) || var_1_21) ? (var_1_7 == ((unsigned char) (var_1_21 && var_1_9))) : (var_1_7 == ((unsigned char) (! var_1_10)))) : 1)) && (var_1_21 ? (var_1_11 == ((signed char) ((((var_1_12) < (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14))))) ? (var_1_12) : (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))))))) : (var_1_11 == ((signed char) (var_1_15 - var_1_16))))) && (var_1_17 == ((signed long int) ((((4) < (((1807938565 - 128) - var_1_16))) ? (4) : (((1807938565 - 128) - var_1_16))))))) && (var_1_7 ? (var_1_18 == ((signed long int) var_1_14)) : (var_1_18 == ((signed long int) (var_1_15 + var_1_14))))) && (((var_1_15 + var_1_17) == var_1_35) ? ((var_1_21 && var_1_10) ? ((var_1_16 < var_1_17) ? (var_1_19 == ((signed short int) ((var_1_12 + var_1_11) + var_1_15))) : 1) : 1) : (var_1_19 == ((signed short int) ((((var_1_13) < (128)) ? (var_1_13) : (128))))))) && ((last_1_var_1_20 <= (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))) ^ var_1_18)) ? (var_1_20 == ((unsigned long int) ((((var_1_31) > ((var_1_31 + var_1_16))) ? (var_1_31) : ((var_1_31 + var_1_16)))))) : (var_1_20 == ((unsigned long int) var_1_31))) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=6, var_1_19=0, var_1_1=5, var_1_20=5, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=5, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=127, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L191] EXPR ((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))) ^ var_1_18 VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=6, var_1_19=0, var_1_1=5, var_1_20=5, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=5, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=127, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L191] EXPR ((((((((- var_1_23) == var_1_23) ? (var_1_1 == ((unsigned long int) (((((var_1_31 + var_1_31)) < (var_1_31)) ? ((var_1_31 + var_1_31)) : (var_1_31))))) : (var_1_1 == ((unsigned long int) var_1_31))) && (((127.35 + var_1_23) <= var_1_23) ? (((var_1_17 < var_1_31) || var_1_21) ? (var_1_7 == ((unsigned char) (var_1_21 && var_1_9))) : (var_1_7 == ((unsigned char) (! var_1_10)))) : 1)) && (var_1_21 ? (var_1_11 == ((signed char) ((((var_1_12) < (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14))))) ? (var_1_12) : (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))))))) : (var_1_11 == ((signed char) (var_1_15 - var_1_16))))) && (var_1_17 == ((signed long int) ((((4) < (((1807938565 - 128) - var_1_16))) ? (4) : (((1807938565 - 128) - var_1_16))))))) && (var_1_7 ? (var_1_18 == ((signed long int) var_1_14)) : (var_1_18 == ((signed long int) (var_1_15 + var_1_14))))) && (((var_1_15 + var_1_17) == var_1_35) ? ((var_1_21 && var_1_10) ? ((var_1_16 < var_1_17) ? (var_1_19 == ((signed short int) ((var_1_12 + var_1_11) + var_1_15))) : 1) : 1) : (var_1_19 == ((signed short int) ((((var_1_13) < (128)) ? (var_1_13) : (128))))))) && ((last_1_var_1_20 <= (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))) ^ var_1_18)) ? (var_1_20 == ((unsigned long int) ((((var_1_31) > ((var_1_31 + var_1_16))) ? (var_1_31) : ((var_1_31 + var_1_16)))))) : (var_1_20 == ((unsigned long int) var_1_31))) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=6, var_1_19=0, var_1_1=5, var_1_20=5, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=5, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=127, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L191-L192] return ((((((((((((((- var_1_23) == var_1_23) ? (var_1_1 == ((unsigned long int) (((((var_1_31 + var_1_31)) < (var_1_31)) ? ((var_1_31 + var_1_31)) : (var_1_31))))) : (var_1_1 == ((unsigned long int) var_1_31))) && (((127.35 + var_1_23) <= var_1_23) ? (((var_1_17 < var_1_31) || var_1_21) ? (var_1_7 == ((unsigned char) (var_1_21 && var_1_9))) : (var_1_7 == ((unsigned char) (! var_1_10)))) : 1)) && (var_1_21 ? (var_1_11 == ((signed char) ((((var_1_12) < (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14))))) ? (var_1_12) : (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))))))) : (var_1_11 == ((signed char) (var_1_15 - var_1_16))))) && (var_1_17 == ((signed long int) ((((4) < (((1807938565 - 128) - var_1_16))) ? (4) : (((1807938565 - 128) - var_1_16))))))) && (var_1_7 ? (var_1_18 == ((signed long int) var_1_14)) : (var_1_18 == ((signed long int) (var_1_15 + var_1_14))))) && (((var_1_15 + var_1_17) == var_1_35) ? ((var_1_21 && var_1_10) ? ((var_1_16 < var_1_17) ? (var_1_19 == ((signed short int) ((var_1_12 + var_1_11) + var_1_15))) : 1) : 1) : (var_1_19 == ((signed short int) ((((var_1_13) < (128)) ? (var_1_13) : (128))))))) && ((last_1_var_1_20 <= (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))) ^ var_1_18)) ? (var_1_20 == ((unsigned long int) ((((var_1_31) > ((var_1_31 + var_1_16))) ? (var_1_31) : ((var_1_31 + var_1_16)))))) : (var_1_20 == ((unsigned long int) var_1_31)))) && (var_1_21 == ((unsigned char) (! (var_1_9 && var_1_22))))) && (var_1_21 ? (var_1_23 == ((float) ((var_1_24 + var_1_25) + ((((var_1_26) < (((((var_1_27) < (var_1_28)) ? (var_1_27) : (var_1_28))))) ? (var_1_26) : (((((var_1_27) < (var_1_28)) ? (var_1_27) : (var_1_28))))))))) : 1)) && (var_1_7 ? (var_1_29 == ((signed long int) ((1349734853 - var_1_16) - (1715174523 - var_1_31)))) : (var_1_29 == ((signed long int) ((((((var_1_16 + var_1_15) + -16)) > (((((var_1_14) < (((((var_1_31) < (var_1_18)) ? (var_1_31) : (var_1_18))))) ? (var_1_14) : (((((var_1_31) < (var_1_18)) ? (var_1_31) : (var_1_18)))))))) ? (((var_1_16 + var_1_15) + -16)) : (((((var_1_14) < (((((var_1_31) < (var_1_18)) ? (var_1_31) : (var_1_18))))) ? (var_1_14) : (((((var_1_31) < (var_1_18)) ? (var_1_31) : (var_1_18))))))))))))) && (var_1_22 ? (var_1_31 == ((unsigned char) ((((var_1_16) < ((var_1_32 - (var_1_33 - var_1_34)))) ? (var_1_16) : ((var_1_32 - (var_1_33 - var_1_34))))))) : 1)) && ((((var_1_17 / var_1_32) > ((((var_1_31) > (var_1_33)) ? (var_1_31) : (var_1_33)))) && var_1_21) ? ((var_1_23 <= 0.125f) ? (var_1_35 == ((signed short int) ((((((var_1_36) < (var_1_37)) ? (var_1_36) : (var_1_37))) - var_1_33) - var_1_16))) : 1) : ((var_1_31 == var_1_29) ? (var_1_35 == ((signed short int) ((((var_1_32) < 0 ) ? -(var_1_32) : (var_1_32))))) : (var_1_35 == ((signed short int) var_1_13))))) && (var_1_9 ? ((var_1_25 == var_1_26) ? (var_1_38 == ((float) (((((var_1_24) < (var_1_39)) ? (var_1_24) : (var_1_39))) + var_1_25))) : (var_1_38 == ((float) var_1_39))) : (var_1_38 == ((float) var_1_25))) ; [L201] RET, EXPR property() [L201] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=6, var_1_19=0, var_1_1=5, var_1_20=5, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=5, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=127, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=6, var_1_19=0, var_1_1=5, var_1_20=5, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=5, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=127, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 44.3s, OverallIterations: 12, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2383 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2369 mSDsluCounter, 5174 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3314 mSDsCounter, 130 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2085 IncrementalHoareTripleChecker+Invalid, 2215 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 130 mSolverCounterUnsat, 1860 mSDtfsCounter, 2085 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1623 GetRequests, 1555 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=382occurred in iteration=7, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 844 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 37.0s InterpolantComputationTime, 3104 NumberOfCodeBlocks, 3104 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3088 ConstructedInterpolants, 0 QuantifiedInterpolants, 16125 SizeOfPredicates, 2 NumberOfNonLiveVariables, 956 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 29346/29760 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:10:40,089 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_100-while_file-41.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 cefce1e082ba19bdab32bd25d6d8c4c5179b384e1b7a368e743da81f29016498 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:10:41,909 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:10:42,004 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:10:42,009 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:10:42,011 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:10:42,035 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:10:42,036 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:10:42,036 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:10:42,036 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:10:42,036 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:10:42,037 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:10:42,037 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:10:42,037 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:10:42,037 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:10:42,037 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:10:42,038 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:10:42,038 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:10:42,038 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:10:42,038 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:10:42,038 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:10:42,038 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:10:42,038 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:10:42,038 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:10:42,038 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 08:10:42,038 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 08:10:42,038 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:10:42,038 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 08:10:42,038 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:10:42,038 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:10:42,038 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:10:42,038 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:10:42,039 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:10:42,039 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:10:42,039 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:10:42,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:10:42,039 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:10:42,039 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:10:42,039 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:10:42,039 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 08:10:42,039 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 08:10:42,039 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:10:42,039 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:10:42,039 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:10:42,039 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:10:42,039 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 -> cefce1e082ba19bdab32bd25d6d8c4c5179b384e1b7a368e743da81f29016498 [2024-11-07 08:10:42,273 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:10:42,281 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:10:42,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:10:42,284 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:10:42,284 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:10:42,286 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-41.i [2024-11-07 08:10:43,430 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:10:43,654 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:10:43,654 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-41.i [2024-11-07 08:10:43,667 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e7cfab122/34007bc0a95449aca93a745ab6575b75/FLAGe2467710b [2024-11-07 08:10:44,002 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e7cfab122/34007bc0a95449aca93a745ab6575b75 [2024-11-07 08:10:44,003 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:10:44,005 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:10:44,005 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:10:44,005 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:10:44,010 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:10:44,011 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:10:44" (1/1) ... [2024-11-07 08:10:44,012 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3af8d07d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:10:44, skipping insertion in model container [2024-11-07 08:10:44,013 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:10:44" (1/1) ... [2024-11-07 08:10:44,037 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:10:44,142 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_100-while_file-41.i[916,929] [2024-11-07 08:10:44,210 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:10:44,225 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:10:44,233 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_100-while_file-41.i[916,929] [2024-11-07 08:10:44,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:10:44,288 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:10:44,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:10:44 WrapperNode [2024-11-07 08:10:44,289 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:10:44,290 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:10:44,290 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:10:44,290 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:10:44,297 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:10:44" (1/1) ... [2024-11-07 08:10:44,306 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:10:44" (1/1) ... [2024-11-07 08:10:44,336 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 204 [2024-11-07 08:10:44,338 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:10:44,338 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:10:44,338 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:10:44,338 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:10:44,346 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:10:44" (1/1) ... [2024-11-07 08:10:44,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:10:44" (1/1) ... [2024-11-07 08:10:44,353 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:10:44" (1/1) ... [2024-11-07 08:10:44,373 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:10:44,373 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:10:44" (1/1) ... [2024-11-07 08:10:44,373 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:10:44" (1/1) ... [2024-11-07 08:10:44,385 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:10:44" (1/1) ... [2024-11-07 08:10:44,389 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:10:44" (1/1) ... [2024-11-07 08:10:44,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:10:44" (1/1) ... [2024-11-07 08:10:44,397 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:10:44" (1/1) ... [2024-11-07 08:10:44,399 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:10:44,407 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:10:44,407 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:10:44,407 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:10:44,408 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:10:44" (1/1) ... [2024-11-07 08:10:44,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:10:44,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:10:44,434 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:10:44,436 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:10:44,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:10:44,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 08:10:44,454 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:10:44,454 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:10:44,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:10:44,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:10:44,522 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:10:44,523 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:10:47,821 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-07 08:10:47,821 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:10:47,829 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:10:47,829 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:10:47,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:10:47 BoogieIcfgContainer [2024-11-07 08:10:47,829 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:10:47,831 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:10:47,831 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:10:47,835 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:10:47,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:10:44" (1/3) ... [2024-11-07 08:10:47,836 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bf7613a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:10:47, skipping insertion in model container [2024-11-07 08:10:47,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:10:44" (2/3) ... [2024-11-07 08:10:47,836 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bf7613a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:10:47, skipping insertion in model container [2024-11-07 08:10:47,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:10:47" (3/3) ... [2024-11-07 08:10:47,837 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-41.i [2024-11-07 08:10:47,847 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:10:47,848 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:10:47,891 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:10:47,900 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;@72222848, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:10:47,900 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:10:47,905 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 55 states have (on average 1.4) internal successors, (77), 56 states have internal predecessors, (77), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 08:10:47,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-07 08:10:47,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:10:47,916 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:47,916 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:10:47,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:10:47,919 INFO L85 PathProgramCache]: Analyzing trace with hash -668581297, now seen corresponding path program 1 times [2024-11-07 08:10:47,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:10:47,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [78870701] [2024-11-07 08:10:47,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:10:47,928 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:10:47,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:10:47,930 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:10:47,932 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:10:48,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:48,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 08:10:48,395 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:10:48,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 734 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2024-11-07 08:10:48,447 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:10:48,448 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:10:48,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [78870701] [2024-11-07 08:10:48,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [78870701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:10:48,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:10:48,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:10:48,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217615753] [2024-11-07 08:10:48,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:10:48,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:10:48,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:10:48,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:10:48,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:10:48,479 INFO L87 Difference]: Start difference. First operand has 90 states, 55 states have (on average 1.4) internal successors, (77), 56 states have internal predecessors, (77), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 08:10:48,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:10:48,506 INFO L93 Difference]: Finished difference Result 173 states and 308 transitions. [2024-11-07 08:10:48,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:10:48,508 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 203 [2024-11-07 08:10:48,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:10:48,514 INFO L225 Difference]: With dead ends: 173 [2024-11-07 08:10:48,514 INFO L226 Difference]: Without dead ends: 86 [2024-11-07 08:10:48,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:10:48,520 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:10:48,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:10:48,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-07 08:10:48,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-07 08:10:48,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 52 states have internal predecessors, (70), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 08:10:48,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 134 transitions. [2024-11-07 08:10:48,569 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 134 transitions. Word has length 203 [2024-11-07 08:10:48,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:10:48,569 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 134 transitions. [2024-11-07 08:10:48,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 08:10:48,569 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 134 transitions. [2024-11-07 08:10:48,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-07 08:10:48,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:10:48,573 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:48,588 INFO L552 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)] Ended with exit code 0 [2024-11-07 08:10:48,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:10:48,774 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:10:48,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:10:48,775 INFO L85 PathProgramCache]: Analyzing trace with hash -398678841, now seen corresponding path program 1 times [2024-11-07 08:10:48,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:10:48,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2084232322] [2024-11-07 08:10:48,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:10:48,776 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:10:48,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:10:48,778 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 08:10:48,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 08:10:49,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:49,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 08:10:49,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:10:49,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1021 proven. 48 refuted. 0 times theorem prover too weak. 915 trivial. 0 not checked. [2024-11-07 08:10:49,826 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:10:50,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 45 proven. 48 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-07 08:10:50,398 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:10:50,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2084232322] [2024-11-07 08:10:50,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2084232322] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 08:10:50,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 08:10:50,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-07 08:10:50,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332661799] [2024-11-07 08:10:50,399 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 08:10:50,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 08:10:50,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:10:50,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 08:10:50,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 08:10:50,401 INFO L87 Difference]: Start difference. First operand 86 states and 134 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2024-11-07 08:10:53,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 08:10:53,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:10:53,517 INFO L93 Difference]: Finished difference Result 177 states and 272 transitions. [2024-11-07 08:10:53,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 08:10:53,540 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) Word has length 203 [2024-11-07 08:10:53,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:10:53,542 INFO L225 Difference]: With dead ends: 177 [2024-11-07 08:10:53,542 INFO L226 Difference]: Without dead ends: 94 [2024-11-07 08:10:53,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 398 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-07 08:10:53,544 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 119 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:10:53,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 223 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-07 08:10:53,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-07 08:10:53,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2024-11-07 08:10:53,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.309090909090909) internal successors, (72), 55 states have internal predecessors, (72), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 08:10:53,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 136 transitions. [2024-11-07 08:10:53,560 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 136 transitions. Word has length 203 [2024-11-07 08:10:53,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:10:53,563 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 136 transitions. [2024-11-07 08:10:53,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2024-11-07 08:10:53,564 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 136 transitions. [2024-11-07 08:10:53,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-07 08:10:53,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:10:53,565 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:53,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 08:10:53,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:10:53,766 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:10:53,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:10:53,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1902143749, now seen corresponding path program 1 times [2024-11-07 08:10:53,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:10:53,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1767955941] [2024-11-07 08:10:53,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:10:53,767 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:10:53,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:10:53,769 INFO L229 MonitoredProcess]: Starting monitored process 4 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:10:53,771 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 (4)] Waiting until timeout for monitored process [2024-11-07 08:10:54,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:54,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 08:10:54,151 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:10:54,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 08:10:54,928 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:10:54,928 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:10:54,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1767955941] [2024-11-07 08:10:54,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1767955941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:10:54,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:10:54,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:10:54,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958062100] [2024-11-07 08:10:54,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:10:54,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 08:10:54,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:10:54,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 08:10:54,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:10:54,929 INFO L87 Difference]: Start difference. First operand 90 states and 136 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 08:10:56,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 08:10:58,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 08:10:58,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:10:58,545 INFO L93 Difference]: Finished difference Result 264 states and 402 transitions. [2024-11-07 08:10:58,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 08:10:58,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 203 [2024-11-07 08:10:58,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:10:58,575 INFO L225 Difference]: With dead ends: 264 [2024-11-07 08:10:58,575 INFO L226 Difference]: Without dead ends: 177 [2024-11-07 08:10:58,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 201 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:10:58,576 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 30 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-07 08:10:58,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 253 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-07 08:10:58,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-07 08:10:58,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 174. [2024-11-07 08:10:58,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 105 states have (on average 1.2952380952380953) internal successors, (136), 105 states have internal predecessors, (136), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 08:10:58,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 264 transitions. [2024-11-07 08:10:58,611 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 264 transitions. Word has length 203 [2024-11-07 08:10:58,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:10:58,611 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 264 transitions. [2024-11-07 08:10:58,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 08:10:58,612 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 264 transitions. [2024-11-07 08:10:58,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-07 08:10:58,614 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:10:58,614 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:58,632 INFO L552 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 (4)] Ended with exit code 0 [2024-11-07 08:10:58,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:10:58,815 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:10:58,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:10:58,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1767282177, now seen corresponding path program 1 times [2024-11-07 08:10:58,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:10:58,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1825901036] [2024-11-07 08:10:58,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:10:58,816 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:10:58,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:10:58,819 INFO L229 MonitoredProcess]: Starting monitored process 5 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:10:58,821 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 (5)] Waiting until timeout for monitored process [2024-11-07 08:11:06,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:06,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-07 08:11:06,901 INFO L278 TraceCheckSpWp]: Computing forward predicates...