./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-48.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_codestructure_steplocals_file-48.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', '171a765531b95b232fbab2e745bfaf521ee849c63dff03ab59f51e1f7468f906'] 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_codestructure_steplocals_file-48.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 171a765531b95b232fbab2e745bfaf521ee849c63dff03ab59f51e1f7468f906 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 04:21:38,869 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 04:21:38,946 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 04:21:38,958 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 04:21:38,958 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 04:21:38,987 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 04:21:38,990 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 04:21:38,990 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 04:21:38,991 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 04:21:38,991 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 04:21:38,992 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 04:21:38,992 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 04:21:38,993 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 04:21:38,993 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 04:21:38,993 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 04:21:38,993 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 04:21:38,993 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 04:21:38,993 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 04:21:38,994 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 04:21:38,994 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 04:21:38,994 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 04:21:38,994 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 04:21:38,994 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 04:21:38,994 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 04:21:38,995 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 04:21:38,995 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 04:21:38,995 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 04:21:38,995 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 04:21:38,995 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 04:21:38,995 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 04:21:38,996 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 04:21:38,996 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 04:21:38,996 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:21:38,996 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 04:21:38,997 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 04:21:38,997 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 04:21:38,997 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 04:21:38,997 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 04:21:38,997 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 04:21:38,997 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 04:21:38,997 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 04:21:38,998 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 04:21:38,998 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 -> 171a765531b95b232fbab2e745bfaf521ee849c63dff03ab59f51e1f7468f906 [2024-11-07 04:21:39,252 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 04:21:39,262 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 04:21:39,265 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 04:21:39,266 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 04:21:39,266 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 04:21:39,267 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-48.i [2024-11-07 04:21:40,557 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 04:21:40,847 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 04:21:40,848 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-48.i [2024-11-07 04:21:40,860 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cf6ca9ba4/ef8f71f81f404c54ad943c831e46720e/FLAG0f2d4bf45 [2024-11-07 04:21:41,136 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cf6ca9ba4/ef8f71f81f404c54ad943c831e46720e [2024-11-07 04:21:41,138 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 04:21:41,139 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 04:21:41,140 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 04:21:41,140 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 04:21:41,143 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 04:21:41,144 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:21:41" (1/1) ... [2024-11-07 04:21:41,145 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68148cb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:41, skipping insertion in model container [2024-11-07 04:21:41,145 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:21:41" (1/1) ... [2024-11-07 04:21:41,164 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 04:21:41,277 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_codestructure_steplocals_file-48.i[917,930] [2024-11-07 04:21:41,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:21:41,339 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 04:21:41,349 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_codestructure_steplocals_file-48.i[917,930] [2024-11-07 04:21:41,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:21:41,389 INFO L204 MainTranslator]: Completed translation [2024-11-07 04:21:41,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:41 WrapperNode [2024-11-07 04:21:41,391 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 04:21:41,391 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 04:21:41,392 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 04:21:41,392 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 04:21:41,396 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:41" (1/1) ... [2024-11-07 04:21:41,404 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:41" (1/1) ... [2024-11-07 04:21:41,432 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 146 [2024-11-07 04:21:41,433 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 04:21:41,433 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 04:21:41,433 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 04:21:41,433 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 04:21:41,445 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:41" (1/1) ... [2024-11-07 04:21:41,445 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:41" (1/1) ... [2024-11-07 04:21:41,448 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:41" (1/1) ... [2024-11-07 04:21:41,466 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 04:21:41,466 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:41" (1/1) ... [2024-11-07 04:21:41,467 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:41" (1/1) ... [2024-11-07 04:21:41,475 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:41" (1/1) ... [2024-11-07 04:21:41,478 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:41" (1/1) ... [2024-11-07 04:21:41,483 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:41" (1/1) ... [2024-11-07 04:21:41,484 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:41" (1/1) ... [2024-11-07 04:21:41,486 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 04:21:41,487 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 04:21:41,487 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 04:21:41,487 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 04:21:41,494 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:41" (1/1) ... [2024-11-07 04:21:41,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:21:41,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:21:41,526 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 04:21:41,532 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 04:21:41,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 04:21:41,548 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 04:21:41,548 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 04:21:41,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 04:21:41,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 04:21:41,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 04:21:41,610 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 04:21:41,613 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 04:21:41,885 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-07 04:21:41,886 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 04:21:41,893 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 04:21:41,893 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 04:21:41,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:21:41 BoogieIcfgContainer [2024-11-07 04:21:41,894 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 04:21:41,896 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 04:21:41,896 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 04:21:41,900 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 04:21:41,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:21:41" (1/3) ... [2024-11-07 04:21:41,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57dccc81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:21:41, skipping insertion in model container [2024-11-07 04:21:41,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:41" (2/3) ... [2024-11-07 04:21:41,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57dccc81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:21:41, skipping insertion in model container [2024-11-07 04:21:41,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:21:41" (3/3) ... [2024-11-07 04:21:41,902 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-48.i [2024-11-07 04:21:41,915 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 04:21:41,915 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 04:21:41,960 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 04:21:41,968 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;@27a1e9a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 04:21:41,968 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 04:21:41,972 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 44 states have internal predecessors, (60), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 04:21:41,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-07 04:21:41,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:21:41,981 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:21:41,982 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:21:41,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:21:41,985 INFO L85 PathProgramCache]: Analyzing trace with hash -759303571, now seen corresponding path program 1 times [2024-11-07 04:21:41,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:21:41,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633833414] [2024-11-07 04:21:41,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:21:41,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:21:42,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:21:42,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:21:42,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:21:42,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 04:21:42,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 04:21:42,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 04:21:42,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 04:21:42,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 04:21:42,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 04:21:42,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 04:21:42,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 04:21:42,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 04:21:42,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 04:21:42,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 04:21:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 04:21:42,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 04:21:42,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 04:21:42,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 04:21:42,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 04:21:42,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 04:21:42,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 04:21:42,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 04:21:42,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,369 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 04:21:42,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:21:42,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633833414] [2024-11-07 04:21:42,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633833414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:21:42,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:21:42,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 04:21:42,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149038558] [2024-11-07 04:21:42,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:21:42,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 04:21:42,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:21:42,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 04:21:42,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 04:21:42,392 INFO L87 Difference]: Start difference. First operand has 68 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 44 states have internal predecessors, (60), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-07 04:21:42,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:21:42,413 INFO L93 Difference]: Finished difference Result 128 states and 222 transitions. [2024-11-07 04:21:42,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 04:21:42,417 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 140 [2024-11-07 04:21:42,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:21:42,424 INFO L225 Difference]: With dead ends: 128 [2024-11-07 04:21:42,425 INFO L226 Difference]: Without dead ends: 63 [2024-11-07 04:21:42,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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 04:21:42,431 INFO L432 NwaCegarLoop]: 94 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, 94 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 04:21:42,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:21:42,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-07 04:21:42,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-07 04:21:42,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 04:21:42,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 94 transitions. [2024-11-07 04:21:42,469 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 94 transitions. Word has length 140 [2024-11-07 04:21:42,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:21:42,469 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 94 transitions. [2024-11-07 04:21:42,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-07 04:21:42,470 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 94 transitions. [2024-11-07 04:21:42,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-07 04:21:42,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:21:42,472 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:21:42,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 04:21:42,473 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:21:42,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:21:42,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1320888027, now seen corresponding path program 1 times [2024-11-07 04:21:42,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:21:42,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320549628] [2024-11-07 04:21:42,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:21:42,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:21:42,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:21:42,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:21:42,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:21:42,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 04:21:42,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 04:21:42,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 04:21:42,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 04:21:42,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 04:21:42,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 04:21:42,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 04:21:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 04:21:42,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 04:21:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 04:21:42,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 04:21:42,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 04:21:42,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 04:21:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 04:21:42,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 04:21:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 04:21:42,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 04:21:42,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 04:21:42,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 04:21:42,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:42,807 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 04:21:42,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:21:42,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320549628] [2024-11-07 04:21:42,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320549628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:21:42,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:21:42,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 04:21:42,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51370077] [2024-11-07 04:21:42,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:21:42,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 04:21:42,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:21:42,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 04:21:42,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 04:21:42,813 INFO L87 Difference]: Start difference. First operand 63 states and 94 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 04:21:42,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:21:42,867 INFO L93 Difference]: Finished difference Result 141 states and 211 transitions. [2024-11-07 04:21:42,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 04:21:42,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 140 [2024-11-07 04:21:42,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:21:42,870 INFO L225 Difference]: With dead ends: 141 [2024-11-07 04:21:42,872 INFO L226 Difference]: Without dead ends: 81 [2024-11-07 04:21:42,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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 04:21:42,873 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 20 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 04:21:42,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 177 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:21:42,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-07 04:21:42,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 68. [2024-11-07 04:21:42,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 04:21:42,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 101 transitions. [2024-11-07 04:21:42,886 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 101 transitions. Word has length 140 [2024-11-07 04:21:42,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:21:42,887 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 101 transitions. [2024-11-07 04:21:42,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 04:21:42,887 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 101 transitions. [2024-11-07 04:21:42,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-07 04:21:42,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:21:42,893 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:21:42,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 04:21:42,893 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:21:42,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:21:42,894 INFO L85 PathProgramCache]: Analyzing trace with hash -2130234653, now seen corresponding path program 1 times [2024-11-07 04:21:42,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:21:42,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007198969] [2024-11-07 04:21:42,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:21:42,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:21:42,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:43,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:21:43,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:43,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:21:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:43,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:21:43,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:43,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 04:21:43,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:43,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 04:21:43,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:43,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 04:21:43,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:43,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 04:21:43,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:43,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 04:21:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:43,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 04:21:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:43,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 04:21:43,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:43,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 04:21:43,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:43,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 04:21:43,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:43,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 04:21:43,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:43,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 04:21:43,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:43,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 04:21:43,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:43,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 04:21:43,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:43,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 04:21:43,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:43,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 04:21:43,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:43,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 04:21:43,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:43,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 04:21:43,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:43,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 04:21:43,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:43,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 04:21:43,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:21:43,530 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 04:21:43,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:21:43,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007198969] [2024-11-07 04:21:43,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007198969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:21:43,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:21:43,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 04:21:43,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286238942] [2024-11-07 04:21:43,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:21:43,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 04:21:43,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:21:43,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 04:21:43,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 04:21:43,534 INFO L87 Difference]: Start difference. First operand 68 states and 101 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2024-11-07 04:21:43,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:21:43,746 INFO L93 Difference]: Finished difference Result 198 states and 297 transitions. [2024-11-07 04:21:43,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 04:21:43,747 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 140 [2024-11-07 04:21:43,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:21:43,749 INFO L225 Difference]: With dead ends: 198 [2024-11-07 04:21:43,749 INFO L226 Difference]: Without dead ends: 133 [2024-11-07 04:21:43,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 04:21:43,754 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 64 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 04:21:43,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 290 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 04:21:43,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-07 04:21:43,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2024-11-07 04:21:43,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 84 states have internal predecessors, (109), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-07 04:21:43,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 197 transitions. [2024-11-07 04:21:43,786 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 197 transitions. Word has length 140 [2024-11-07 04:21:43,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:21:43,787 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 197 transitions. [2024-11-07 04:21:43,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2024-11-07 04:21:43,787 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 197 transitions. [2024-11-07 04:21:43,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-07 04:21:43,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:21:43,789 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:21:43,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 04:21:43,789 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:21:43,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:21:43,790 INFO L85 PathProgramCache]: Analyzing trace with hash -2072976351, now seen corresponding path program 1 times [2024-11-07 04:21:43,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:21:43,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134675930] [2024-11-07 04:21:43,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:21:43,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:21:43,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 04:21:43,922 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 04:21:43,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 04:21:44,054 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 04:21:44,054 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 04:21:44,055 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 04:21:44,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 04:21:44,060 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-07 04:21:44,146 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 04:21:44,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:21:44 BoogieIcfgContainer [2024-11-07 04:21:44,150 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 04:21:44,150 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 04:21:44,150 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 04:21:44,150 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 04:21:44,151 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:21:41" (3/4) ... [2024-11-07 04:21:44,154 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 04:21:44,155 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 04:21:44,156 INFO L158 Benchmark]: Toolchain (without parser) took 3016.75ms. Allocated memory is still 100.7MB. Free memory was 76.4MB in the beginning and 47.0MB in the end (delta: 29.4MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB. [2024-11-07 04:21:44,156 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 83.9MB. Free memory is still 47.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:21:44,157 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.19ms. Allocated memory is still 100.7MB. Free memory was 76.3MB in the beginning and 62.2MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 04:21:44,157 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.22ms. Allocated memory is still 100.7MB. Free memory was 62.2MB in the beginning and 59.1MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:21:44,157 INFO L158 Benchmark]: Boogie Preprocessor took 52.83ms. Allocated memory is still 100.7MB. Free memory was 59.1MB in the beginning and 54.3MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 04:21:44,158 INFO L158 Benchmark]: RCFGBuilder took 407.40ms. Allocated memory is still 100.7MB. Free memory was 54.3MB in the beginning and 72.2MB in the end (delta: -17.9MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. [2024-11-07 04:21:44,158 INFO L158 Benchmark]: TraceAbstraction took 2253.31ms. Allocated memory is still 100.7MB. Free memory was 71.7MB in the beginning and 47.0MB in the end (delta: 24.7MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. [2024-11-07 04:21:44,159 INFO L158 Benchmark]: Witness Printer took 4.69ms. Allocated memory is still 100.7MB. Free memory was 47.0MB in the beginning and 47.0MB in the end (delta: 22.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:21:44,160 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.19ms. Allocated memory is still 83.9MB. Free memory is still 47.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 251.19ms. Allocated memory is still 100.7MB. Free memory was 76.3MB in the beginning and 62.2MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.22ms. Allocated memory is still 100.7MB. Free memory was 62.2MB in the beginning and 59.1MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 52.83ms. Allocated memory is still 100.7MB. Free memory was 59.1MB in the beginning and 54.3MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 407.40ms. Allocated memory is still 100.7MB. Free memory was 54.3MB in the beginning and 72.2MB in the end (delta: -17.9MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2253.31ms. Allocated memory is still 100.7MB. Free memory was 71.7MB in the beginning and 47.0MB in the end (delta: 24.7MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. * Witness Printer took 4.69ms. Allocated memory is still 100.7MB. Free memory was 47.0MB in the beginning and 47.0MB in the end (delta: 22.5kB). 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 137. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 10; [L23] unsigned char var_1_2 = 1; [L24] double var_1_3 = 0.0; [L25] double var_1_4 = 128.2; [L26] double var_1_5 = 50.1; [L27] double var_1_6 = 64.5; [L28] unsigned short int var_1_7 = 1; [L29] unsigned char var_1_8 = 5; [L30] double var_1_9 = 15.35; [L31] unsigned char var_1_10 = 10; [L32] unsigned char var_1_11 = 2; [L33] signed long int var_1_12 = 32; [L34] signed long int var_1_13 = 256; [L35] signed char var_1_14 = 1; [L36] unsigned char var_1_15 = 128; [L37] unsigned char var_1_16 = 0; [L38] signed char var_1_17 = -64; [L39] unsigned short int var_1_18 = 64; [L40] signed long int var_1_19 = 128; VAL [isInitial=0, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=1, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L141] isInitial = 1 [L142] FCALL initially() [L143] COND TRUE 1 [L144] FCALL updateLastVariables() [L145] CALL updateVariables() [L98] var_1_2 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L99] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L100] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L100] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L101] var_1_3 = __VERIFIER_nondet_double() [L102] CALL assume_abort_if_not((var_1_3 >= 4611686.018427387900e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L102] RET assume_abort_if_not((var_1_3 >= 4611686.018427387900e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L103] var_1_4 = __VERIFIER_nondet_double() [L104] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427387900e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L104] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427387900e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L105] var_1_5 = __VERIFIER_nondet_double() [L106] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L106] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L107] var_1_6 = __VERIFIER_nondet_double() [L108] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=1, var_1_8=5, var_1_9=307/20] [L108] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=1, var_1_8=5, var_1_9=307/20] [L109] var_1_7 = __VERIFIER_nondet_ushort() [L110] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_8=5, var_1_9=307/20] [L110] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_8=5, var_1_9=307/20] [L111] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5, var_1_9=307/20] [L111] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5, var_1_9=307/20] [L112] var_1_9 = __VERIFIER_nondet_double() [L113] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L113] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L114] CALL assume_abort_if_not(var_1_9 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L114] RET assume_abort_if_not(var_1_9 != 0.0F) VAL [isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L115] var_1_10 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L116] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L117] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L117] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, var_1_10=0, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L118] var_1_11 = __VERIFIER_nondet_uchar() [L119] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L119] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=0, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L120] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L120] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L121] var_1_15 = __VERIFIER_nondet_uchar() [L122] CALL assume_abort_if_not(var_1_15 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L122] RET assume_abort_if_not(var_1_15 >= 127) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L123] CALL assume_abort_if_not(var_1_15 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L123] RET assume_abort_if_not(var_1_15 <= 255) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L124] var_1_16 = __VERIFIER_nondet_uchar() [L125] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L125] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L126] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=127, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=127, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L126] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=127, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L127] var_1_17 = __VERIFIER_nondet_char() [L128] CALL assume_abort_if_not(var_1_17 >= -126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=127, var_1_17=-1, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=127, var_1_17=-1, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L128] RET assume_abort_if_not(var_1_17 >= -126) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=127, var_1_17=-1, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L129] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=127, var_1_17=-1, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=127, var_1_17=-1, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L129] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=127, var_1_17=-1, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L130] var_1_19 = __VERIFIER_nondet_long() [L131] CALL assume_abort_if_not(var_1_19 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=127, var_1_17=-1, var_1_18=64, var_1_19=0, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=127, var_1_17=-1, var_1_18=64, var_1_19=0, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L131] RET assume_abort_if_not(var_1_19 >= -2147483648) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=127, var_1_17=-1, var_1_18=64, var_1_19=0, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L132] CALL assume_abort_if_not(var_1_19 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=127, var_1_17=-1, var_1_18=64, var_1_19=0, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=127, var_1_17=-1, var_1_18=64, var_1_19=0, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L132] RET assume_abort_if_not(var_1_19 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=127, var_1_17=-1, var_1_18=64, var_1_19=0, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L145] RET updateVariables() [L146] CALL step() [L44] COND FALSE !(\read(var_1_2)) [L51] var_1_1 = 1 VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=127, var_1_17=-1, var_1_18=64, var_1_19=0, var_1_1=1, var_1_2=0, var_1_7=-65536, var_1_8=5] [L53] unsigned short int stepLocal_0 = var_1_7; VAL [isInitial=1, stepLocal_0=-65536, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=127, var_1_17=-1, var_1_18=64, var_1_19=0, var_1_1=1, var_1_2=0, var_1_7=-65536, var_1_8=5] [L54] COND TRUE var_1_6 > (var_1_5 / ((((var_1_3) > (var_1_9)) ? (var_1_3) : (var_1_9)))) [L55] var_1_8 = ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) VAL [isInitial=1, stepLocal_0=-65536, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=127, var_1_17=-1, var_1_18=64, var_1_19=0, var_1_1=1, var_1_2=0, var_1_7=-65536, var_1_8=0] [L63] COND FALSE !(\read(var_1_2)) [L72] var_1_12 = var_1_8 VAL [isInitial=1, stepLocal_0=-65536, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=127, var_1_17=-1, var_1_18=64, var_1_19=0, var_1_1=1, var_1_2=0, var_1_7=-65536, var_1_8=0] [L74] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, stepLocal_0=-65536, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=127, var_1_17=-1, var_1_18=64, var_1_19=0, var_1_1=1, var_1_2=0, var_1_7=-65536, var_1_8=0] [L77] signed long int stepLocal_1 = ((((var_1_15 - var_1_16)) > (var_1_13)) ? ((var_1_15 - var_1_16)) : (var_1_13)); VAL [isInitial=1, stepLocal_0=-65536, stepLocal_1=256, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=127, var_1_17=-1, var_1_18=64, var_1_19=0, var_1_1=1, var_1_2=0, var_1_7=-65536, var_1_8=0] [L78] COND FALSE !(var_1_10 == stepLocal_1) [L81] var_1_14 = var_1_17 VAL [isInitial=1, stepLocal_0=-65536, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=256, var_1_14=-1, var_1_15=131, var_1_16=127, var_1_17=-1, var_1_18=64, var_1_19=0, var_1_1=1, var_1_2=0, var_1_7=-65536, var_1_8=0] [L83] COND TRUE var_1_7 == var_1_12 [L84] var_1_18 = (var_1_10 + ((((var_1_8) < (var_1_16)) ? (var_1_8) : (var_1_16)))) VAL [isInitial=1, stepLocal_0=-65536, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=256, var_1_14=-1, var_1_15=131, var_1_16=127, var_1_17=-1, var_1_18=0, var_1_19=0, var_1_1=1, var_1_2=0, var_1_7=-65536, var_1_8=0] [L146] RET step() [L147] CALL, EXPR property() [L137-L138] return (((((var_1_2 ? ((((var_1_3 - var_1_4) - var_1_5) == (15.75 - var_1_6)) ? (var_1_1 == ((unsigned short int) (5 + var_1_7))) : (var_1_1 == ((unsigned short int) var_1_7))) : (var_1_1 == ((unsigned short int) 1))) && ((var_1_6 > (var_1_5 / ((((var_1_3) > (var_1_9)) ? (var_1_3) : (var_1_9))))) ? (var_1_8 == ((unsigned char) ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))))) : ((var_1_1 <= var_1_7) ? (var_1_8 == ((unsigned char) var_1_10)) : (var_1_8 == ((unsigned char) var_1_11))))) && (var_1_2 ? ((-128 > var_1_10) ? ((var_1_3 >= (2.75 / var_1_9)) ? (var_1_12 == ((signed long int) (var_1_11 + (var_1_1 + var_1_10)))) : (var_1_12 == ((signed long int) var_1_1))) : 1) : (var_1_12 == ((signed long int) var_1_8)))) && (var_1_2 ? (var_1_13 == ((signed long int) var_1_11)) : 1)) && ((var_1_10 == (((((var_1_15 - var_1_16)) > (var_1_13)) ? ((var_1_15 - var_1_16)) : (var_1_13)))) ? (var_1_14 == ((signed char) ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))))) : (var_1_14 == ((signed char) var_1_17)))) && ((var_1_7 == var_1_12) ? (var_1_18 == ((unsigned short int) (var_1_10 + ((((var_1_8) < (var_1_16)) ? (var_1_8) : (var_1_16)))))) : ((var_1_14 != var_1_16) ? ((-256 >= var_1_19) ? (var_1_18 == ((unsigned short int) var_1_16)) : (var_1_18 == ((unsigned short int) var_1_15))) : (var_1_18 == ((unsigned short int) var_1_10)))) ; VAL [\result=0, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=256, var_1_14=-1, var_1_15=131, var_1_16=127, var_1_17=-1, var_1_18=0, var_1_19=0, var_1_1=1, var_1_2=0, var_1_7=-65536, var_1_8=0] [L147] RET, EXPR property() [L147] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=256, var_1_14=-1, var_1_15=131, var_1_16=127, var_1_17=-1, var_1_18=0, var_1_19=0, var_1_1=1, var_1_2=0, var_1_7=-65536, var_1_8=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=256, var_1_14=-1, var_1_15=131, var_1_16=127, var_1_17=-1, var_1_18=0, var_1_19=0, var_1_1=1, var_1_2=0, var_1_7=-65536, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 68 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 4, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 84 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 84 mSDsluCounter, 561 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 283 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 91 IncrementalHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 278 mSDtfsCounter, 91 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 167 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=131occurred in iteration=3, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 15 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 560 NumberOfCodeBlocks, 560 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 417 ConstructedInterpolants, 0 QuantifiedInterpolants, 771 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2772/2772 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 04:21:44,189 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_codestructure_steplocals_file-48.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 171a765531b95b232fbab2e745bfaf521ee849c63dff03ab59f51e1f7468f906 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 04:21:46,329 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 04:21:46,425 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 04:21:46,431 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 04:21:46,431 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 04:21:46,456 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 04:21:46,457 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 04:21:46,457 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 04:21:46,458 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 04:21:46,458 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 04:21:46,458 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 04:21:46,459 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 04:21:46,459 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 04:21:46,459 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 04:21:46,459 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 04:21:46,460 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 04:21:46,460 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 04:21:46,460 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 04:21:46,460 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 04:21:46,460 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 04:21:46,460 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 04:21:46,461 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 04:21:46,461 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 04:21:46,461 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 04:21:46,461 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 04:21:46,461 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 04:21:46,461 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 04:21:46,461 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 04:21:46,461 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 04:21:46,462 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 04:21:46,462 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 04:21:46,462 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 04:21:46,462 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 04:21:46,462 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 04:21:46,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:21:46,463 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 04:21:46,463 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 04:21:46,463 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 04:21:46,463 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 04:21:46,463 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 04:21:46,463 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 04:21:46,463 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 04:21:46,464 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 04:21:46,464 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 04:21:46,464 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 -> 171a765531b95b232fbab2e745bfaf521ee849c63dff03ab59f51e1f7468f906 [2024-11-07 04:21:46,773 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 04:21:46,783 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 04:21:46,785 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 04:21:46,788 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 04:21:46,789 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 04:21:46,790 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-48.i [2024-11-07 04:21:48,110 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 04:21:48,354 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 04:21:48,356 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-48.i [2024-11-07 04:21:48,365 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d9b3303df/6ef413f01c844a30b85ebf93c09d5333/FLAG56cd6fc84 [2024-11-07 04:21:48,383 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d9b3303df/6ef413f01c844a30b85ebf93c09d5333 [2024-11-07 04:21:48,386 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 04:21:48,388 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 04:21:48,391 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 04:21:48,391 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 04:21:48,397 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 04:21:48,398 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:21:48" (1/1) ... [2024-11-07 04:21:48,398 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@273b9f37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:48, skipping insertion in model container [2024-11-07 04:21:48,399 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:21:48" (1/1) ... [2024-11-07 04:21:48,416 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 04:21:48,553 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_codestructure_steplocals_file-48.i[917,930] [2024-11-07 04:21:48,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:21:48,623 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 04:21:48,635 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_codestructure_steplocals_file-48.i[917,930] [2024-11-07 04:21:48,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:21:48,697 INFO L204 MainTranslator]: Completed translation [2024-11-07 04:21:48,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:48 WrapperNode [2024-11-07 04:21:48,699 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 04:21:48,700 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 04:21:48,700 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 04:21:48,700 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 04:21:48,708 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:48" (1/1) ... [2024-11-07 04:21:48,725 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:48" (1/1) ... [2024-11-07 04:21:48,756 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 144 [2024-11-07 04:21:48,757 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 04:21:48,758 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 04:21:48,759 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 04:21:48,759 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 04:21:48,767 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:48" (1/1) ... [2024-11-07 04:21:48,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:48" (1/1) ... [2024-11-07 04:21:48,772 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:48" (1/1) ... [2024-11-07 04:21:48,791 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 04:21:48,791 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:48" (1/1) ... [2024-11-07 04:21:48,791 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:48" (1/1) ... [2024-11-07 04:21:48,805 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:48" (1/1) ... [2024-11-07 04:21:48,808 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:48" (1/1) ... [2024-11-07 04:21:48,814 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:48" (1/1) ... [2024-11-07 04:21:48,819 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:48" (1/1) ... [2024-11-07 04:21:48,822 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 04:21:48,826 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 04:21:48,827 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 04:21:48,827 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 04:21:48,828 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:48" (1/1) ... [2024-11-07 04:21:48,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:21:48,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:21:48,860 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 04:21:48,863 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 04:21:48,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 04:21:48,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 04:21:48,883 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 04:21:48,884 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 04:21:48,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 04:21:48,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 04:21:48,955 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 04:21:48,957 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 04:22:09,890 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-07 04:22:09,890 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 04:22:09,898 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 04:22:09,898 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 04:22:09,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:22:09 BoogieIcfgContainer [2024-11-07 04:22:09,899 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 04:22:09,902 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 04:22:09,902 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 04:22:09,907 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 04:22:09,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:21:48" (1/3) ... [2024-11-07 04:22:09,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15532f33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:22:09, skipping insertion in model container [2024-11-07 04:22:09,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:48" (2/3) ... [2024-11-07 04:22:09,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15532f33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:22:09, skipping insertion in model container [2024-11-07 04:22:09,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:22:09" (3/3) ... [2024-11-07 04:22:09,927 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-48.i [2024-11-07 04:22:09,940 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 04:22:09,940 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 04:22:09,991 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 04:22:10,004 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;@69ad549d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 04:22:10,005 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 04:22:10,009 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 44 states have internal predecessors, (60), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 04:22:10,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-07 04:22:10,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:22:10,022 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:22:10,023 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:22:10,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:22:10,028 INFO L85 PathProgramCache]: Analyzing trace with hash -759303571, now seen corresponding path program 1 times [2024-11-07 04:22:10,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:22:10,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [612169316] [2024-11-07 04:22:10,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:22:10,040 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 04:22:10,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:22:10,047 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 04:22:10,049 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 04:22:11,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:22:11,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 04:22:11,499 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:22:11,557 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2024-11-07 04:22:11,557 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 04:22:11,558 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 04:22:11,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [612169316] [2024-11-07 04:22:11,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [612169316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:22:11,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:22:11,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 04:22:11,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835021019] [2024-11-07 04:22:11,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:22:11,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 04:22:11,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 04:22:11,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 04:22:11,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 04:22:11,591 INFO L87 Difference]: Start difference. First operand has 68 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 44 states have internal predecessors, (60), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-07 04:22:11,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:22:11,624 INFO L93 Difference]: Finished difference Result 128 states and 222 transitions. [2024-11-07 04:22:11,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 04:22:11,626 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 140 [2024-11-07 04:22:11,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:22:11,634 INFO L225 Difference]: With dead ends: 128 [2024-11-07 04:22:11,634 INFO L226 Difference]: Without dead ends: 63 [2024-11-07 04:22:11,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 139 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 04:22:11,641 INFO L432 NwaCegarLoop]: 94 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, 94 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 04:22:11,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:22:11,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-07 04:22:11,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-07 04:22:11,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 04:22:11,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 94 transitions. [2024-11-07 04:22:11,688 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 94 transitions. Word has length 140 [2024-11-07 04:22:11,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:22:11,688 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 94 transitions. [2024-11-07 04:22:11,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-07 04:22:11,689 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 94 transitions. [2024-11-07 04:22:11,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-07 04:22:11,693 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:22:11,693 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:22:11,738 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 04:22:11,897 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 04:22:11,898 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:22:11,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:22:11,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1320888027, now seen corresponding path program 1 times [2024-11-07 04:22:11,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:22:11,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [630241873] [2024-11-07 04:22:11,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:22:11,900 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 04:22:11,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:22:11,902 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 04:22:11,904 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 04:22:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:22:13,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 04:22:13,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:22:13,686 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 04:22:13,686 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 04:22:13,686 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 04:22:13,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [630241873] [2024-11-07 04:22:13,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [630241873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:22:13,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:22:13,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 04:22:13,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578429352] [2024-11-07 04:22:13,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:22:13,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 04:22:13,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 04:22:13,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 04:22:13,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 04:22:13,689 INFO L87 Difference]: Start difference. First operand 63 states and 94 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 04:22:18,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.43s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:22:22,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:22:22,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:22:22,564 INFO L93 Difference]: Finished difference Result 141 states and 211 transitions. [2024-11-07 04:22:22,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 04:22:22,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 140 [2024-11-07 04:22:22,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:22:22,567 INFO L225 Difference]: With dead ends: 141 [2024-11-07 04:22:22,567 INFO L226 Difference]: Without dead ends: 81 [2024-11-07 04:22:22,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 04:22:22,568 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 20 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2024-11-07 04:22:22,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 177 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 2 Unknown, 0 Unchecked, 8.8s Time] [2024-11-07 04:22:22,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-07 04:22:22,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 68. [2024-11-07 04:22:22,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 04:22:22,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 101 transitions. [2024-11-07 04:22:22,582 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 101 transitions. Word has length 140 [2024-11-07 04:22:22,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:22:22,585 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 101 transitions. [2024-11-07 04:22:22,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 04:22:22,586 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 101 transitions. [2024-11-07 04:22:22,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-07 04:22:22,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:22:22,589 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:22:22,640 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 04:22:22,790 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 04:22:22,790 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:22:22,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:22:22,791 INFO L85 PathProgramCache]: Analyzing trace with hash -2130234653, now seen corresponding path program 1 times [2024-11-07 04:22:22,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:22:22,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1172812679] [2024-11-07 04:22:22,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:22:22,791 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 04:22:22,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:22:22,793 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 04:22:22,795 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 04:22:24,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:22:24,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 04:22:24,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:22:30,363 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 04:22:30,364 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 04:22:30,364 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 04:22:30,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1172812679] [2024-11-07 04:22:30,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1172812679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:22:30,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:22:30,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 04:22:30,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451382102] [2024-11-07 04:22:30,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:22:30,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 04:22:30,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 04:22:30,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 04:22:30,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 04:22:30,366 INFO L87 Difference]: Start difference. First operand 68 states and 101 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 04:22:35,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.43s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:22:39,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:22:43,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:22:47,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:22:47,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:22:47,177 INFO L93 Difference]: Finished difference Result 198 states and 297 transitions. [2024-11-07 04:22:47,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 04:22:47,348 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 140 [2024-11-07 04:22:47,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:22:47,351 INFO L225 Difference]: With dead ends: 198 [2024-11-07 04:22:47,351 INFO L226 Difference]: Without dead ends: 133 [2024-11-07 04:22:47,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 04:22:47,352 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 22 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.7s IncrementalHoareTripleChecker+Time [2024-11-07 04:22:47,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 269 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 4 Unknown, 0 Unchecked, 16.7s Time] [2024-11-07 04:22:47,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-07 04:22:47,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2024-11-07 04:22:47,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 84 states have internal predecessors, (109), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-07 04:22:47,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 197 transitions. [2024-11-07 04:22:47,371 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 197 transitions. Word has length 140 [2024-11-07 04:22:47,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:22:47,372 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 197 transitions. [2024-11-07 04:22:47,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 04:22:47,372 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 197 transitions. [2024-11-07 04:22:47,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-07 04:22:47,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:22:47,374 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:22:47,410 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 04:22:47,574 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 04:22:47,575 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:22:47,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:22:47,575 INFO L85 PathProgramCache]: Analyzing trace with hash -2072976351, now seen corresponding path program 1 times [2024-11-07 04:22:47,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:22:47,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [822473835] [2024-11-07 04:22:47,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:22:47,576 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 04:22:47,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:22:47,578 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 04:22:47,579 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 04:22:48,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:22:49,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-07 04:22:49,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:22:57,943 WARN L286 SmtUtils]: Spent 8.56s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-07 04:23:11,390 WARN L286 SmtUtils]: Spent 8.52s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-07 04:23:19,562 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)