./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-6.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-6.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', '65abe7cb35c9006c604c8d360a97fa1428e6f141c9dbba60a5491dff00208bf7'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-6.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 65abe7cb35c9006c604c8d360a97fa1428e6f141c9dbba60a5491dff00208bf7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:04:00,680 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:04:00,766 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 10:04:00,774 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:04:00,775 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:04:00,805 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:04:00,807 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:04:00,807 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:04:00,807 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:04:00,808 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:04:00,808 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:04:00,808 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:04:00,808 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:04:00,809 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:04:00,809 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:04:00,809 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:04:00,809 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:04:00,810 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:04:00,810 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 10:04:00,810 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:04:00,810 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:04:00,810 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:04:00,810 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:04:00,810 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:04:00,810 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:04:00,810 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:04:00,810 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:04:00,810 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:04:00,810 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:04:00,810 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:04:00,810 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:04:00,810 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:04:00,810 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:04:00,811 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:04:00,811 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:04:00,811 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:04:00,811 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 10:04:00,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 10:04:00,811 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:04:00,811 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:04:00,811 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:04:00,812 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:04:00,812 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 -> 65abe7cb35c9006c604c8d360a97fa1428e6f141c9dbba60a5491dff00208bf7 [2024-11-07 10:04:01,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:04:01,074 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:04:01,077 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:04:01,078 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:04:01,078 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:04:01,081 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-6.i [2024-11-07 10:04:02,425 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:04:02,695 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:04:02,696 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-6.i [2024-11-07 10:04:02,705 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d8fa0e525/591df2d27f354b08aa76fa14dc9a1906/FLAG985af6021 [2024-11-07 10:04:02,720 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d8fa0e525/591df2d27f354b08aa76fa14dc9a1906 [2024-11-07 10:04:02,723 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:04:02,724 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:04:02,726 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:04:02,727 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:04:02,731 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:04:02,732 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:04:02" (1/1) ... [2024-11-07 10:04:02,733 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c6ff18c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:04:02, skipping insertion in model container [2024-11-07 10:04:02,733 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:04:02" (1/1) ... [2024-11-07 10:04:02,750 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:04:02,893 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-6.i[912,925] [2024-11-07 10:04:02,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:04:02,974 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:04:02,988 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-6.i[912,925] [2024-11-07 10:04:03,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:04:03,028 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:04:03,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:04:03 WrapperNode [2024-11-07 10:04:03,029 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:04:03,030 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:04:03,030 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:04:03,030 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:04:03,035 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:04:03" (1/1) ... [2024-11-07 10:04:03,042 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:04:03" (1/1) ... [2024-11-07 10:04:03,076 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 125 [2024-11-07 10:04:03,077 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:04:03,078 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:04:03,078 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:04:03,078 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:04:03,093 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:04:03" (1/1) ... [2024-11-07 10:04:03,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:04:03" (1/1) ... [2024-11-07 10:04:03,101 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:04:03" (1/1) ... [2024-11-07 10:04:03,128 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 10:04:03,128 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:04:03" (1/1) ... [2024-11-07 10:04:03,128 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:04:03" (1/1) ... [2024-11-07 10:04:03,136 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:04:03" (1/1) ... [2024-11-07 10:04:03,139 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:04:03" (1/1) ... [2024-11-07 10:04:03,144 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:04:03" (1/1) ... [2024-11-07 10:04:03,146 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:04:03" (1/1) ... [2024-11-07 10:04:03,148 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:04:03,149 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:04:03,149 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:04:03,149 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:04:03,150 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:04:03" (1/1) ... [2024-11-07 10:04:03,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:04:03,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:04:03,191 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 10:04:03,195 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 10:04:03,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:04:03,218 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:04:03,218 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:04:03,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 10:04:03,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:04:03,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:04:03,301 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:04:03,303 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:04:03,629 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-07 10:04:03,629 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:04:03,638 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:04:03,638 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:04:03,639 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:04:03 BoogieIcfgContainer [2024-11-07 10:04:03,639 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:04:03,641 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:04:03,641 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:04:03,647 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:04:03,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:04:02" (1/3) ... [2024-11-07 10:04:03,648 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f99a27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:04:03, skipping insertion in model container [2024-11-07 10:04:03,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:04:03" (2/3) ... [2024-11-07 10:04:03,649 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f99a27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:04:03, skipping insertion in model container [2024-11-07 10:04:03,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:04:03" (3/3) ... [2024-11-07 10:04:03,651 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-6.i [2024-11-07 10:04:03,665 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:04:03,665 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:04:03,731 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:04:03,745 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;@4004c545, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:04:03,746 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:04:03,752 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 10:04:03,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-07 10:04:03,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:04:03,767 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:04:03,768 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:04:03,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:04:03,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1544026128, now seen corresponding path program 1 times [2024-11-07 10:04:03,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:04:03,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186248312] [2024-11-07 10:04:03,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:04:03,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:04:03,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:04,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:04:04,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:04,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 10:04:04,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:04,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 10:04:04,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:04,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 10:04:04,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:04,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 10:04:04,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:04,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:04:04,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:04,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 10:04:04,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:04,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 10:04:04,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:04,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 10:04:04,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:04,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 10:04:04,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:04,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 10:04:04,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:04,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 10:04:04,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:04,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 10:04:04,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:04,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 10:04:04,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:04,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:04:04,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:04,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:04:04,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:04,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 10:04:04,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:04,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 10:04:04,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:04,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 10:04:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:04,233 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:04:04,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:04:04,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186248312] [2024-11-07 10:04:04,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186248312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:04:04,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:04:04,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:04:04,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691915995] [2024-11-07 10:04:04,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:04:04,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:04:04,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:04:04,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:04:04,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:04:04,265 INFO L87 Difference]: Start difference. First operand has 56 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 10:04:04,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:04:04,287 INFO L93 Difference]: Finished difference Result 105 states and 179 transitions. [2024-11-07 10:04:04,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:04:04,290 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 120 [2024-11-07 10:04:04,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:04:04,295 INFO L225 Difference]: With dead ends: 105 [2024-11-07 10:04:04,296 INFO L226 Difference]: Without dead ends: 52 [2024-11-07 10:04:04,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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 10:04:04,306 INFO L432 NwaCegarLoop]: 76 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, 76 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 10:04:04,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:04:04,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-07 10:04:04,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-07 10:04:04,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 10:04:04,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. [2024-11-07 10:04:04,357 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 120 [2024-11-07 10:04:04,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:04:04,359 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 76 transitions. [2024-11-07 10:04:04,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 10:04:04,360 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2024-11-07 10:04:04,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-07 10:04:04,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:04:04,364 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:04:04,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 10:04:04,365 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:04:04,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:04:04,365 INFO L85 PathProgramCache]: Analyzing trace with hash 555848794, now seen corresponding path program 1 times [2024-11-07 10:04:04,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:04:04,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060421144] [2024-11-07 10:04:04,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:04:04,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:04:04,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:04,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:04:04,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:04,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 10:04:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:04,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 10:04:04,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:04,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 10:04:04,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:04,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 10:04:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:04,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:04:04,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:04,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 10:04:04,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:04,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 10:04:04,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:04,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 10:04:04,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:04,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 10:04:04,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:04,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 10:04:04,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:04,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 10:04:04,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:04,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 10:04:04,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:04,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 10:04:04,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:04,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:04:04,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:04,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:04:04,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:04,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 10:04:04,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:04,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 10:04:04,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:04,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 10:04:04,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:04,981 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:04:04,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:04:04,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060421144] [2024-11-07 10:04:04,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060421144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:04:04,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:04:04,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:04:04,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573549445] [2024-11-07 10:04:04,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:04:04,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 10:04:04,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:04:04,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 10:04:04,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:04:04,987 INFO L87 Difference]: Start difference. First operand 52 states and 76 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:04:05,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:04:05,063 INFO L93 Difference]: Finished difference Result 136 states and 198 transitions. [2024-11-07 10:04:05,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:04:05,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 120 [2024-11-07 10:04:05,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:04:05,067 INFO L225 Difference]: With dead ends: 136 [2024-11-07 10:04:05,067 INFO L226 Difference]: Without dead ends: 87 [2024-11-07 10:04:05,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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 10:04:05,068 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 47 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:04:05,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 175 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:04:05,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-07 10:04:05,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2024-11-07 10:04:05,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 52 states have internal predecessors, (62), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-07 10:04:05,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 122 transitions. [2024-11-07 10:04:05,093 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 122 transitions. Word has length 120 [2024-11-07 10:04:05,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:04:05,096 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 122 transitions. [2024-11-07 10:04:05,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:04:05,097 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 122 transitions. [2024-11-07 10:04:05,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-07 10:04:05,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:04:05,101 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:04:05,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 10:04:05,101 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:04:05,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:04:05,103 INFO L85 PathProgramCache]: Analyzing trace with hash -253497832, now seen corresponding path program 1 times [2024-11-07 10:04:05,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:04:05,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757899696] [2024-11-07 10:04:05,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:04:05,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:04:05,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:05,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:04:05,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:05,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 10:04:05,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:05,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 10:04:05,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:05,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 10:04:05,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:05,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 10:04:05,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:05,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:04:05,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:05,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 10:04:05,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:05,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 10:04:05,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:05,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 10:04:05,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:05,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 10:04:05,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:05,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 10:04:05,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:05,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 10:04:05,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:05,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 10:04:05,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:05,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 10:04:05,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:05,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:04:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:05,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:04:05,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:05,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 10:04:05,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:05,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 10:04:05,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:05,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 10:04:05,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:05,654 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:04:05,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:04:05,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757899696] [2024-11-07 10:04:05,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757899696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:04:05,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:04:05,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:04:05,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744661802] [2024-11-07 10:04:05,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:04:05,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:04:05,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:04:05,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:04:05,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:04:05,657 INFO L87 Difference]: Start difference. First operand 84 states and 122 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:04:05,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:04:05,845 INFO L93 Difference]: Finished difference Result 165 states and 241 transitions. [2024-11-07 10:04:05,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:04:05,847 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 120 [2024-11-07 10:04:05,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:04:05,850 INFO L225 Difference]: With dead ends: 165 [2024-11-07 10:04:05,850 INFO L226 Difference]: Without dead ends: 84 [2024-11-07 10:04:05,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 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 10:04:05,855 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 55 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:04:05,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 72 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:04:05,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-07 10:04:05,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-07 10:04:05,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 52 states have internal predecessors, (60), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-07 10:04:05,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 120 transitions. [2024-11-07 10:04:05,885 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 120 transitions. Word has length 120 [2024-11-07 10:04:05,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:04:05,888 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 120 transitions. [2024-11-07 10:04:05,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:04:05,888 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 120 transitions. [2024-11-07 10:04:05,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-07 10:04:05,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:04:05,892 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:04:05,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 10:04:05,893 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:04:05,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:04:05,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1521509530, now seen corresponding path program 1 times [2024-11-07 10:04:05,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:04:05,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486246966] [2024-11-07 10:04:05,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:04:05,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:04:06,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:11,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:04:11,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:11,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 10:04:11,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:11,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 10:04:11,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:11,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 10:04:11,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:11,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 10:04:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:11,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:04:11,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:11,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 10:04:11,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:11,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 10:04:11,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:11,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 10:04:11,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:11,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 10:04:11,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:11,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 10:04:11,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:11,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 10:04:11,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:11,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 10:04:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:11,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 10:04:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:11,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:04:11,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:11,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:04:11,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:11,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 10:04:11,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:11,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 10:04:11,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:11,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 10:04:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:11,841 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:04:11,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:04:11,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486246966] [2024-11-07 10:04:11,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486246966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:04:11,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:04:11,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 10:04:11,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432006480] [2024-11-07 10:04:11,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:04:11,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 10:04:11,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:04:11,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 10:04:11,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:04:11,844 INFO L87 Difference]: Start difference. First operand 84 states and 120 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:04:15,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:04:15,149 INFO L93 Difference]: Finished difference Result 153 states and 214 transitions. [2024-11-07 10:04:15,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 10:04:15,150 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 120 [2024-11-07 10:04:15,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:04:15,153 INFO L225 Difference]: With dead ends: 153 [2024-11-07 10:04:15,153 INFO L226 Difference]: Without dead ends: 151 [2024-11-07 10:04:15,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2024-11-07 10:04:15,154 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 93 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 10:04:15,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 414 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 10:04:15,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-07 10:04:15,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 128. [2024-11-07 10:04:15,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 75 states have (on average 1.1466666666666667) internal successors, (86), 76 states have internal predecessors, (86), 49 states have call successors, (49), 3 states have call predecessors, (49), 3 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2024-11-07 10:04:15,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 184 transitions. [2024-11-07 10:04:15,203 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 184 transitions. Word has length 120 [2024-11-07 10:04:15,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:04:15,204 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 184 transitions. [2024-11-07 10:04:15,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:04:15,205 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 184 transitions. [2024-11-07 10:04:15,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-07 10:04:15,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:04:15,210 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:04:15,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 10:04:15,210 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:04:15,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:04:15,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1046974830, now seen corresponding path program 1 times [2024-11-07 10:04:15,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:04:15,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750995410] [2024-11-07 10:04:15,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:04:15,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:04:15,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:18,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:04:18,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:18,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 10:04:18,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:18,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 10:04:18,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:18,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 10:04:18,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:18,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 10:04:18,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:18,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:04:18,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:18,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 10:04:18,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:18,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 10:04:18,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:18,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 10:04:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:18,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 10:04:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:18,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 10:04:18,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:18,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 10:04:18,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:18,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 10:04:18,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:18,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 10:04:18,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:18,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:04:18,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:18,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:04:18,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:18,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 10:04:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:18,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 10:04:18,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:18,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 10:04:18,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:18,795 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:04:18,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:04:18,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750995410] [2024-11-07 10:04:18,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750995410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:04:18,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:04:18,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 10:04:18,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780389174] [2024-11-07 10:04:18,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:04:18,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 10:04:18,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:04:18,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 10:04:18,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:04:18,805 INFO L87 Difference]: Start difference. First operand 128 states and 184 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:04:19,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:04:19,821 INFO L93 Difference]: Finished difference Result 160 states and 220 transitions. [2024-11-07 10:04:19,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 10:04:19,823 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 121 [2024-11-07 10:04:19,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:04:19,826 INFO L225 Difference]: With dead ends: 160 [2024-11-07 10:04:19,828 INFO L226 Difference]: Without dead ends: 158 [2024-11-07 10:04:19,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:04:19,830 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 69 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 10:04:19,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 396 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 10:04:19,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-07 10:04:19,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 135. [2024-11-07 10:04:19,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 82 states have (on average 1.1585365853658536) internal successors, (95), 83 states have internal predecessors, (95), 49 states have call successors, (49), 3 states have call predecessors, (49), 3 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2024-11-07 10:04:19,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 193 transitions. [2024-11-07 10:04:19,879 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 193 transitions. Word has length 121 [2024-11-07 10:04:19,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:04:19,880 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 193 transitions. [2024-11-07 10:04:19,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:04:19,881 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 193 transitions. [2024-11-07 10:04:19,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-07 10:04:19,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:04:19,884 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:04:19,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 10:04:19,885 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:04:19,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:04:19,885 INFO L85 PathProgramCache]: Analyzing trace with hash 237628204, now seen corresponding path program 1 times [2024-11-07 10:04:19,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:04:19,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601435218] [2024-11-07 10:04:19,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:04:19,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:04:19,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:23,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:04:23,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:23,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 10:04:23,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:23,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 10:04:23,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:23,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 10:04:23,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:23,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 10:04:23,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:23,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:04:23,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:23,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 10:04:23,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:23,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 10:04:23,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:23,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 10:04:23,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:23,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 10:04:23,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:23,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 10:04:23,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:23,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 10:04:23,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:23,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 10:04:23,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:23,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 10:04:23,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:23,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:04:23,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:23,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:04:23,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:23,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 10:04:23,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:23,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 10:04:23,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:23,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 10:04:23,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:23,477 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:04:23,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:04:23,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601435218] [2024-11-07 10:04:23,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601435218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:04:23,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:04:23,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 10:04:23,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684225305] [2024-11-07 10:04:23,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:04:23,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 10:04:23,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:04:23,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 10:04:23,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:04:23,479 INFO L87 Difference]: Start difference. First operand 135 states and 193 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:04:25,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:04:25,982 INFO L93 Difference]: Finished difference Result 163 states and 223 transitions. [2024-11-07 10:04:25,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 10:04:25,983 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 121 [2024-11-07 10:04:25,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:04:25,985 INFO L225 Difference]: With dead ends: 163 [2024-11-07 10:04:25,985 INFO L226 Difference]: Without dead ends: 161 [2024-11-07 10:04:25,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:04:25,986 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 69 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:04:25,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 392 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:04:25,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-07 10:04:26,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 135. [2024-11-07 10:04:26,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 82 states have (on average 1.1585365853658536) internal successors, (95), 83 states have internal predecessors, (95), 49 states have call successors, (49), 3 states have call predecessors, (49), 3 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2024-11-07 10:04:26,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 193 transitions. [2024-11-07 10:04:26,018 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 193 transitions. Word has length 121 [2024-11-07 10:04:26,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:04:26,018 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 193 transitions. [2024-11-07 10:04:26,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:04:26,019 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 193 transitions. [2024-11-07 10:04:26,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-07 10:04:26,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:04:26,020 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:04:26,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 10:04:26,021 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:04:26,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:04:26,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1727033200, now seen corresponding path program 1 times [2024-11-07 10:04:26,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:04:26,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618691032] [2024-11-07 10:04:26,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:04:26,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:04:26,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 10:04:26,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1713316552] [2024-11-07 10:04:26,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:04:26,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:04:26,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:04:26,089 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 10:04:26,091 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 10:04:26,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:04:26,320 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 10:04:26,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:04:26,450 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 10:04:26,451 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 10:04:26,453 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 10:04:26,476 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 10:04:26,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:04:26,661 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:04:26,756 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 10:04:26,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:04:26 BoogieIcfgContainer [2024-11-07 10:04:26,761 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 10:04:26,762 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 10:04:26,762 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 10:04:26,762 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 10:04:26,763 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:04:03" (3/4) ... [2024-11-07 10:04:26,766 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 10:04:26,766 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 10:04:26,768 INFO L158 Benchmark]: Toolchain (without parser) took 24043.05ms. Allocated memory was 117.4MB in the beginning and 285.2MB in the end (delta: 167.8MB). Free memory was 91.8MB in the beginning and 160.6MB in the end (delta: -68.8MB). Peak memory consumption was 99.6MB. Max. memory is 16.1GB. [2024-11-07 10:04:26,768 INFO L158 Benchmark]: CDTParser took 0.49ms. Allocated memory is still 117.4MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:04:26,768 INFO L158 Benchmark]: CACSL2BoogieTranslator took 303.00ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 78.5MB in the end (delta: 13.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 10:04:26,769 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.29ms. Allocated memory is still 117.4MB. Free memory was 78.5MB in the beginning and 76.2MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:04:26,769 INFO L158 Benchmark]: Boogie Preprocessor took 70.30ms. Allocated memory is still 117.4MB. Free memory was 76.0MB in the beginning and 73.2MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:04:26,770 INFO L158 Benchmark]: RCFGBuilder took 490.37ms. Allocated memory is still 117.4MB. Free memory was 73.2MB in the beginning and 56.1MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 10:04:26,770 INFO L158 Benchmark]: TraceAbstraction took 23119.90ms. Allocated memory was 117.4MB in the beginning and 285.2MB in the end (delta: 167.8MB). Free memory was 55.6MB in the beginning and 160.7MB in the end (delta: -105.1MB). Peak memory consumption was 66.1MB. Max. memory is 16.1GB. [2024-11-07 10:04:26,770 INFO L158 Benchmark]: Witness Printer took 4.68ms. Allocated memory is still 285.2MB. Free memory was 160.7MB in the beginning and 160.6MB in the end (delta: 109.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:04:26,772 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.49ms. Allocated memory is still 117.4MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 303.00ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 78.5MB in the end (delta: 13.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.29ms. Allocated memory is still 117.4MB. Free memory was 78.5MB in the beginning and 76.2MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 70.30ms. Allocated memory is still 117.4MB. Free memory was 76.0MB in the beginning and 73.2MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 490.37ms. Allocated memory is still 117.4MB. Free memory was 73.2MB in the beginning and 56.1MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 23119.90ms. Allocated memory was 117.4MB in the beginning and 285.2MB in the end (delta: 167.8MB). Free memory was 55.6MB in the beginning and 160.7MB in the end (delta: -105.1MB). Peak memory consumption was 66.1MB. Max. memory is 16.1GB. * Witness Printer took 4.68ms. Allocated memory is still 285.2MB. Free memory was 160.7MB in the beginning and 160.6MB in the end (delta: 109.7kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 106. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 0; [L23] unsigned short int var_1_4 = 32; [L24] unsigned short int var_1_6 = 10; [L25] signed long int var_1_7 = 4; [L26] signed long int var_1_8 = 2; [L27] double var_1_9 = 0.0; [L28] double var_1_10 = 64.2; [L29] double var_1_11 = 0.0; [L30] double var_1_12 = 0.25; [L31] unsigned short int var_1_13 = 36833; [L32] unsigned char var_1_14 = 0; [L33] unsigned char var_1_16 = 0; [L34] unsigned char var_1_17 = 0; [L35] signed long int var_1_18 = -32; [L36] unsigned long int var_1_20 = 50; [L37] unsigned long int var_1_21 = 2655070710; [L38] unsigned char last_1_var_1_14 = 0; [L39] signed long int last_1_var_1_18 = -32; [L40] unsigned long int last_1_var_1_20 = 50; VAL [isInitial=0, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=32, var_1_6=10, var_1_7=4, var_1_8=2, var_1_9=0] [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] CALL updateLastVariables() [L101] last_1_var_1_14 = var_1_14 [L102] last_1_var_1_18 = var_1_18 [L103] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=32, var_1_6=10, var_1_7=4, var_1_8=2, var_1_9=0] [L113] RET updateLastVariables() [L114] CALL updateVariables() [L69] var_1_4 = __VERIFIER_nondet_ushort() [L70] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_6=10, var_1_7=4, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_6=10, var_1_7=4, var_1_8=2, var_1_9=0] [L70] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_6=10, var_1_7=4, var_1_8=2, var_1_9=0] [L71] CALL assume_abort_if_not(var_1_4 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_6=10, var_1_7=4, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_6=10, var_1_7=4, var_1_8=2, var_1_9=0] [L71] RET assume_abort_if_not(var_1_4 <= 65535) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_6=10, var_1_7=4, var_1_8=2, var_1_9=0] [L72] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=-65518, var_1_6=10, var_1_7=4, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=-65518, var_1_6=10, var_1_7=4, var_1_8=2, var_1_9=0] [L72] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=-65518, var_1_6=10, var_1_7=4, var_1_8=2, var_1_9=0] [L73] var_1_7 = __VERIFIER_nondet_long() [L74] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=2, var_1_9=0] [L74] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=2, var_1_9=0] [L75] CALL assume_abort_if_not(var_1_7 <= 17) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=2, var_1_9=0] [L75] RET assume_abort_if_not(var_1_7 <= 17) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=2, var_1_9=0] [L76] var_1_8 = __VERIFIER_nondet_long() [L77] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=16, var_1_9=0] [L77] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=16, var_1_9=0] [L78] CALL assume_abort_if_not(var_1_8 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=16, var_1_9=0] [L78] RET assume_abort_if_not(var_1_8 <= 16) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=16, var_1_9=0] [L79] var_1_9 = __VERIFIER_nondet_double() [L80] CALL assume_abort_if_not((var_1_9 >= 4611686.018427387900e+12F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=16] [L80] RET assume_abort_if_not((var_1_9 >= 4611686.018427387900e+12F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=16] [L81] var_1_10 = __VERIFIER_nondet_double() [L82] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427387900e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=16] [L82] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427387900e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=16] [L83] var_1_11 = __VERIFIER_nondet_double() [L84] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=16] [L84] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=16] [L85] var_1_12 = __VERIFIER_nondet_double() [L86] CALL assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=16] [L86] RET assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=16] [L87] var_1_13 = __VERIFIER_nondet_ushort() [L88] CALL assume_abort_if_not(var_1_13 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=16] [L88] RET assume_abort_if_not(var_1_13 >= 32767) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=16] [L89] CALL assume_abort_if_not(var_1_13 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=16] [L89] RET assume_abort_if_not(var_1_13 <= 65534) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=16] [L90] var_1_16 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=16] [L91] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=16] [L92] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=16] [L92] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=16] [L93] var_1_17 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=16] [L94] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=16] [L95] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=16] [L95] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=16] [L96] var_1_21 = __VERIFIER_nondet_ulong() [L97] CALL assume_abort_if_not(var_1_21 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=6442450943, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=6442450943, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=16] [L97] RET assume_abort_if_not(var_1_21 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=6442450943, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=16] [L98] CALL assume_abort_if_not(var_1_21 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=6442450943, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=6442450943, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=16] [L98] RET assume_abort_if_not(var_1_21 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=6442450943, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=16] [L114] RET updateVariables() [L115] CALL step() [L44] COND TRUE (var_1_4 - last_1_var_1_20) == last_1_var_1_18 VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=6442450943, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=16] [L45] COND FALSE !(((var_1_9 - var_1_10) - var_1_11) > var_1_12) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=6442450943, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=16] [L51] COND TRUE var_1_13 > var_1_6 [L52] var_1_18 = (((((var_1_6) < (var_1_13)) ? (var_1_6) : (var_1_13))) - var_1_6) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=0, var_1_20=50, var_1_21=6442450943, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=16] [L54] COND FALSE !(\read(last_1_var_1_14)) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=0, var_1_20=50, var_1_21=6442450943, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=16] [L57] var_1_20 = ((((((((last_1_var_1_20) < 0 ) ? -(last_1_var_1_20) : (last_1_var_1_20)))) < ((var_1_21 - var_1_7))) ? (((((last_1_var_1_20) < 0 ) ? -(last_1_var_1_20) : (last_1_var_1_20)))) : ((var_1_21 - var_1_7)))) [L58] unsigned long int stepLocal_1 = var_1_20; [L59] unsigned long int stepLocal_0 = var_1_20; VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, stepLocal_0=50, stepLocal_1=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=0, var_1_20=50, var_1_21=6442450943, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=16] [L60] COND FALSE !((((((var_1_18) > (var_1_18)) ? (var_1_18) : (var_1_18))) / var_1_4) > stepLocal_1) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, stepLocal_0=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=0, var_1_20=50, var_1_21=6442450943, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=16] [L115] RET step() [L116] CALL, EXPR property() [L106-L107] return ((((((((((var_1_18) > (var_1_18)) ? (var_1_18) : (var_1_18))) / var_1_4) > var_1_20) ? ((var_1_20 == var_1_18) ? (var_1_1 == ((unsigned long int) 1000000000u)) : (var_1_1 == ((unsigned long int) 128u))) : 1) && (((var_1_4 - last_1_var_1_20) == last_1_var_1_18) ? ((((var_1_9 - var_1_10) - var_1_11) > var_1_12) ? (var_1_6 == ((unsigned short int) (var_1_13 - var_1_8))) : 1) : (var_1_6 == ((unsigned short int) var_1_13)))) && (last_1_var_1_14 ? (var_1_14 == ((unsigned char) (var_1_16 && var_1_17))) : 1)) && ((var_1_13 > var_1_6) ? (var_1_18 == ((signed long int) (((((var_1_6) < (var_1_13)) ? (var_1_6) : (var_1_13))) - var_1_6))) : 1)) && (var_1_20 == ((unsigned long int) ((((((((last_1_var_1_20) < 0 ) ? -(last_1_var_1_20) : (last_1_var_1_20)))) < ((var_1_21 - var_1_7))) ? (((((last_1_var_1_20) < 0 ) ? -(last_1_var_1_20) : (last_1_var_1_20)))) : ((var_1_21 - var_1_7)))))) ; VAL [\result=0, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=0, var_1_20=50, var_1_21=6442450943, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=16] [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=0, var_1_20=50, var_1_21=6442450943, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=16] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=0, var_1_20=50, var_1_21=6442450943, var_1_4=-65518, var_1_6=10, var_1_7=17, var_1_8=16] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.9s, OverallIterations: 7, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 333 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 333 mSDsluCounter, 1525 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1035 mSDsCounter, 118 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 582 IncrementalHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 118 mSolverCounterUnsat, 490 mSDtfsCounter, 582 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 307 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 7.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=135occurred in iteration=5, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 75 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 14.1s InterpolantComputationTime, 964 NumberOfCodeBlocks, 964 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 716 ConstructedInterpolants, 0 QuantifiedInterpolants, 3663 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 4104/4104 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 10:04:26,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-6.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 65abe7cb35c9006c604c8d360a97fa1428e6f141c9dbba60a5491dff00208bf7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:04:29,177 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:04:29,289 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 10:04:29,300 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:04:29,300 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:04:29,332 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:04:29,333 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:04:29,333 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:04:29,334 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:04:29,334 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:04:29,335 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:04:29,335 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:04:29,335 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:04:29,335 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:04:29,336 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:04:29,336 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:04:29,336 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:04:29,336 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:04:29,336 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:04:29,336 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:04:29,336 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:04:29,336 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:04:29,336 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:04:29,336 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 10:04:29,336 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 10:04:29,336 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:04:29,336 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 10:04:29,336 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:04:29,337 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:04:29,337 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:04:29,337 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:04:29,337 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:04:29,337 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:04:29,337 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:04:29,337 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:04:29,337 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:04:29,337 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:04:29,337 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:04:29,337 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 10:04:29,337 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 10:04:29,337 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:04:29,337 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:04:29,338 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:04:29,338 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:04:29,338 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 -> 65abe7cb35c9006c604c8d360a97fa1428e6f141c9dbba60a5491dff00208bf7 [2024-11-07 10:04:29,658 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:04:29,666 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:04:29,669 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:04:29,671 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:04:29,671 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:04:29,673 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-6.i [2024-11-07 10:04:30,997 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:04:31,258 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:04:31,258 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-6.i [2024-11-07 10:04:31,274 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a44b1456f/fa7f1487b01a4f8cb3de5edadc08f2dd/FLAG13938432f [2024-11-07 10:04:31,296 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a44b1456f/fa7f1487b01a4f8cb3de5edadc08f2dd [2024-11-07 10:04:31,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:04:31,300 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:04:31,302 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:04:31,302 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:04:31,306 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:04:31,307 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:04:31" (1/1) ... [2024-11-07 10:04:31,309 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@686f45ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:04:31, skipping insertion in model container [2024-11-07 10:04:31,309 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:04:31" (1/1) ... [2024-11-07 10:04:31,331 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:04:31,485 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-6.i[912,925] [2024-11-07 10:04:31,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:04:31,574 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:04:31,590 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-6.i[912,925] [2024-11-07 10:04:31,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:04:31,653 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:04:31,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:04:31 WrapperNode [2024-11-07 10:04:31,655 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:04:31,656 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:04:31,656 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:04:31,656 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:04:31,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:04:31" (1/1) ... [2024-11-07 10:04:31,682 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:04:31" (1/1) ... [2024-11-07 10:04:31,714 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 123 [2024-11-07 10:04:31,718 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:04:31,719 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:04:31,722 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:04:31,722 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:04:31,731 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:04:31" (1/1) ... [2024-11-07 10:04:31,731 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:04:31" (1/1) ... [2024-11-07 10:04:31,734 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:04:31" (1/1) ... [2024-11-07 10:04:31,756 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 10:04:31,757 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:04:31" (1/1) ... [2024-11-07 10:04:31,757 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:04:31" (1/1) ... [2024-11-07 10:04:31,768 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:04:31" (1/1) ... [2024-11-07 10:04:31,778 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:04:31" (1/1) ... [2024-11-07 10:04:31,783 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:04:31" (1/1) ... [2024-11-07 10:04:31,785 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:04:31" (1/1) ... [2024-11-07 10:04:31,792 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:04:31,793 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:04:31,793 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:04:31,793 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:04:31,795 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:04:31" (1/1) ... [2024-11-07 10:04:31,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:04:31,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:04:31,837 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 10:04:31,845 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 10:04:31,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:04:31,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 10:04:31,867 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:04:31,867 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:04:31,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:04:31,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:04:31,968 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:04:31,970 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:04:34,217 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-07 10:04:34,217 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:04:34,230 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:04:34,230 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:04:34,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:04:34 BoogieIcfgContainer [2024-11-07 10:04:34,231 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:04:34,234 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:04:34,234 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:04:34,239 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:04:34,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:04:31" (1/3) ... [2024-11-07 10:04:34,240 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d4ff30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:04:34, skipping insertion in model container [2024-11-07 10:04:34,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:04:31" (2/3) ... [2024-11-07 10:04:34,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d4ff30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:04:34, skipping insertion in model container [2024-11-07 10:04:34,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:04:34" (3/3) ... [2024-11-07 10:04:34,242 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-6.i [2024-11-07 10:04:34,257 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:04:34,258 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:04:34,350 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:04:34,363 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;@6891c798, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:04:34,363 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:04:34,369 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 10:04:34,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-07 10:04:34,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:04:34,381 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:04:34,382 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:04:34,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:04:34,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1544026128, now seen corresponding path program 1 times [2024-11-07 10:04:34,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:04:34,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [808622866] [2024-11-07 10:04:34,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:04:34,403 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 10:04:34,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:04:34,407 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 10:04:34,409 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 10:04:34,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:34,730 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 10:04:34,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:04:34,788 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2024-11-07 10:04:34,788 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:04:34,791 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:04:34,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [808622866] [2024-11-07 10:04:34,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [808622866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:04:34,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:04:34,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:04:34,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911022171] [2024-11-07 10:04:34,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:04:34,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:04:34,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:04:34,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:04:34,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:04:34,813 INFO L87 Difference]: Start difference. First operand has 56 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 10:04:34,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:04:34,833 INFO L93 Difference]: Finished difference Result 105 states and 179 transitions. [2024-11-07 10:04:34,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:04:34,835 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 120 [2024-11-07 10:04:34,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:04:34,841 INFO L225 Difference]: With dead ends: 105 [2024-11-07 10:04:34,841 INFO L226 Difference]: Without dead ends: 52 [2024-11-07 10:04:34,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 119 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 10:04:34,847 INFO L432 NwaCegarLoop]: 76 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, 76 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 10:04:34,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:04:34,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-07 10:04:34,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-07 10:04:34,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 10:04:34,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. [2024-11-07 10:04:34,890 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 120 [2024-11-07 10:04:34,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:04:34,891 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 76 transitions. [2024-11-07 10:04:34,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 10:04:34,892 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2024-11-07 10:04:34,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-07 10:04:34,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:04:34,895 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:04:34,906 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 10:04:35,096 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 10:04:35,096 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:04:35,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:04:35,097 INFO L85 PathProgramCache]: Analyzing trace with hash 555848794, now seen corresponding path program 1 times [2024-11-07 10:04:35,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:04:35,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [845320834] [2024-11-07 10:04:35,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:04:35,098 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 10:04:35,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:04:35,101 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 10:04:35,104 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 10:04:35,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:35,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 10:04:35,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:04:35,455 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:04:35,455 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:04:35,455 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:04:35,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [845320834] [2024-11-07 10:04:35,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [845320834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:04:35,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:04:35,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:04:35,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895267510] [2024-11-07 10:04:35,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:04:35,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 10:04:35,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:04:35,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 10:04:35,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:04:35,459 INFO L87 Difference]: Start difference. First operand 52 states and 76 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:04:37,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:04:37,051 INFO L93 Difference]: Finished difference Result 136 states and 198 transitions. [2024-11-07 10:04:37,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:04:37,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 120 [2024-11-07 10:04:37,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:04:37,054 INFO L225 Difference]: With dead ends: 136 [2024-11-07 10:04:37,054 INFO L226 Difference]: Without dead ends: 87 [2024-11-07 10:04:37,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 118 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 10:04:37,056 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 47 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-07 10:04:37,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 175 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-07 10:04:37,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-07 10:04:37,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2024-11-07 10:04:37,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 52 states have internal predecessors, (62), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-07 10:04:37,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 122 transitions. [2024-11-07 10:04:37,084 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 122 transitions. Word has length 120 [2024-11-07 10:04:37,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:04:37,085 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 122 transitions. [2024-11-07 10:04:37,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:04:37,085 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 122 transitions. [2024-11-07 10:04:37,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-07 10:04:37,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:04:37,087 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:04:37,099 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 10:04:37,287 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 10:04:37,288 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:04:37,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:04:37,288 INFO L85 PathProgramCache]: Analyzing trace with hash -253497832, now seen corresponding path program 1 times [2024-11-07 10:04:37,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:04:37,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2032375079] [2024-11-07 10:04:37,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:04:37,289 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 10:04:37,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:04:37,293 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 10:04:37,307 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 10:04:37,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:37,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 10:04:37,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:04:38,038 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:04:38,039 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:04:38,040 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:04:38,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2032375079] [2024-11-07 10:04:38,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2032375079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:04:38,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:04:38,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:04:38,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277149911] [2024-11-07 10:04:38,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:04:38,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:04:38,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:04:38,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:04:38,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:04:38,043 INFO L87 Difference]: Start difference. First operand 84 states and 122 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:04:39,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:04:39,190 INFO L93 Difference]: Finished difference Result 165 states and 241 transitions. [2024-11-07 10:04:39,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:04:39,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 120 [2024-11-07 10:04:39,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:04:39,224 INFO L225 Difference]: With dead ends: 165 [2024-11-07 10:04:39,224 INFO L226 Difference]: Without dead ends: 84 [2024-11-07 10:04:39,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 117 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 10:04:39,226 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 52 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:04:39,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 72 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 10:04:39,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-07 10:04:39,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-07 10:04:39,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 52 states have internal predecessors, (60), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-07 10:04:39,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 120 transitions. [2024-11-07 10:04:39,242 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 120 transitions. Word has length 120 [2024-11-07 10:04:39,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:04:39,243 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 120 transitions. [2024-11-07 10:04:39,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:04:39,243 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 120 transitions. [2024-11-07 10:04:39,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-07 10:04:39,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:04:39,245 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:04:39,258 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 10:04:39,446 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 10:04:39,446 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:04:39,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:04:39,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1521509530, now seen corresponding path program 1 times [2024-11-07 10:04:39,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:04:39,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1693158797] [2024-11-07 10:04:39,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:04:39,448 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 10:04:39,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:04:39,450 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 10:04:39,453 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 10:04:39,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:04:39,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-07 10:04:39,720 INFO L278 TraceCheckSpWp]: Computing forward predicates...