./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p08.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p08.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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', '64bit', '--witnessprinter.graph.data.programhash', '3888704d5a955b45281a90f2156d0109c7e11fdda93c54cd78435365c9c632be'] 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/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p08.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 3888704d5a955b45281a90f2156d0109c7e11fdda93c54cd78435365c9c632be --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 03:46:03,590 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 03:46:03,674 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-07 03:46:03,679 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 03:46:03,680 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 03:46:03,701 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 03:46:03,702 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 03:46:03,703 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 03:46:03,703 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 03:46:03,703 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 03:46:03,704 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 03:46:03,704 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 03:46:03,704 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 03:46:03,705 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 03:46:03,705 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 03:46:03,705 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 03:46:03,705 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 03:46:03,705 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 03:46:03,705 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 03:46:03,705 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 03:46:03,705 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 03:46:03,706 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 03:46:03,706 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 03:46:03,706 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 03:46:03,706 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 03:46:03,706 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 03:46:03,706 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 03:46:03,706 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 03:46:03,706 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 03:46:03,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:46:03,706 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 03:46:03,707 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 03:46:03,707 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 03:46:03,707 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 03:46:03,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 03:46:03,707 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 03:46:03,707 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 03:46:03,707 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 03:46:03,707 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 03:46:03,707 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3888704d5a955b45281a90f2156d0109c7e11fdda93c54cd78435365c9c632be [2024-11-07 03:46:03,919 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 03:46:03,926 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 03:46:03,927 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 03:46:03,928 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 03:46:03,928 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 03:46:03,929 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p08.c [2024-11-07 03:46:05,027 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 03:46:05,253 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 03:46:05,255 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p08.c [2024-11-07 03:46:05,264 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d5a6970ff/a9de2735533449df93c80fdcb31cce02/FLAG62586a5fa [2024-11-07 03:46:05,591 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d5a6970ff/a9de2735533449df93c80fdcb31cce02 [2024-11-07 03:46:05,592 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 03:46:05,593 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 03:46:05,594 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 03:46:05,594 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 03:46:05,597 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 03:46:05,597 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:46:05" (1/1) ... [2024-11-07 03:46:05,598 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24a836c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:05, skipping insertion in model container [2024-11-07 03:46:05,598 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:46:05" (1/1) ... [2024-11-07 03:46:05,615 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 03:46:05,701 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/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p08.c[1266,1279] [2024-11-07 03:46:05,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:46:05,765 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 03:46:05,773 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/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p08.c[1266,1279] [2024-11-07 03:46:05,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:46:05,819 INFO L204 MainTranslator]: Completed translation [2024-11-07 03:46:05,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:05 WrapperNode [2024-11-07 03:46:05,820 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 03:46:05,821 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 03:46:05,821 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 03:46:05,821 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 03:46:05,827 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:05" (1/1) ... [2024-11-07 03:46:05,834 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:05" (1/1) ... [2024-11-07 03:46:05,873 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 413 [2024-11-07 03:46:05,874 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 03:46:05,874 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 03:46:05,874 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 03:46:05,874 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 03:46:05,880 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:05" (1/1) ... [2024-11-07 03:46:05,880 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:05" (1/1) ... [2024-11-07 03:46:05,885 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:05" (1/1) ... [2024-11-07 03:46:05,906 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 03:46:05,906 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:05" (1/1) ... [2024-11-07 03:46:05,906 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:05" (1/1) ... [2024-11-07 03:46:05,920 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:05" (1/1) ... [2024-11-07 03:46:05,923 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:05" (1/1) ... [2024-11-07 03:46:05,926 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:05" (1/1) ... [2024-11-07 03:46:05,928 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:05" (1/1) ... [2024-11-07 03:46:05,937 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 03:46:05,938 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 03:46:05,938 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 03:46:05,938 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 03:46:05,938 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:05" (1/1) ... [2024-11-07 03:46:05,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:46:05,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 03:46:05,965 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 03:46:05,971 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 03:46:05,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 03:46:05,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 03:46:05,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 03:46:05,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 03:46:06,063 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 03:46:06,065 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 03:46:06,432 INFO L? ?]: Removed 180 outVars from TransFormulas that were not future-live. [2024-11-07 03:46:06,432 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 03:46:06,441 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 03:46:06,442 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 03:46:06,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:46:06 BoogieIcfgContainer [2024-11-07 03:46:06,442 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 03:46:06,444 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 03:46:06,444 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 03:46:06,448 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 03:46:06,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:46:05" (1/3) ... [2024-11-07 03:46:06,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24fa1d4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:46:06, skipping insertion in model container [2024-11-07 03:46:06,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:05" (2/3) ... [2024-11-07 03:46:06,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24fa1d4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:46:06, skipping insertion in model container [2024-11-07 03:46:06,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:46:06" (3/3) ... [2024-11-07 03:46:06,450 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p08.c [2024-11-07 03:46:06,459 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 03:46:06,459 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 03:46:06,491 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 03:46:06,500 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;@793dbcb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 03:46:06,501 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 03:46:06,503 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 76 states have (on average 1.486842105263158) internal successors, (113), 77 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:46:06,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-07 03:46:06,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:46:06,508 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 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 03:46:06,509 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:46:06,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:46:06,513 INFO L85 PathProgramCache]: Analyzing trace with hash 475139788, now seen corresponding path program 1 times [2024-11-07 03:46:06,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:46:06,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074488914] [2024-11-07 03:46:06,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:46:06,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:46:06,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:46:06,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 03:46:06,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:46:06,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074488914] [2024-11-07 03:46:06,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074488914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:46:06,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:46:06,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:46:06,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910050911] [2024-11-07 03:46:06,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:46:06,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:46:06,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:46:06,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:46:06,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:46:06,991 INFO L87 Difference]: Start difference. First operand has 78 states, 76 states have (on average 1.486842105263158) internal successors, (113), 77 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:46:07,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:46:07,029 INFO L93 Difference]: Finished difference Result 125 states and 183 transitions. [2024-11-07 03:46:07,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:46:07,033 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-07 03:46:07,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:46:07,038 INFO L225 Difference]: With dead ends: 125 [2024-11-07 03:46:07,039 INFO L226 Difference]: Without dead ends: 77 [2024-11-07 03:46:07,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:46:07,043 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:46:07,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 315 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:46:07,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-07 03:46:07,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-07 03:46:07,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.4605263157894737) internal successors, (111), 76 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:46:07,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 111 transitions. [2024-11-07 03:46:07,069 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 111 transitions. Word has length 29 [2024-11-07 03:46:07,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:46:07,070 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 111 transitions. [2024-11-07 03:46:07,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:46:07,070 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 111 transitions. [2024-11-07 03:46:07,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-07 03:46:07,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:46:07,071 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 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 03:46:07,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 03:46:07,071 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:46:07,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:46:07,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1846126849, now seen corresponding path program 1 times [2024-11-07 03:46:07,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:46:07,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945416414] [2024-11-07 03:46:07,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:46:07,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:46:07,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:46:07,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 03:46:07,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:46:07,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945416414] [2024-11-07 03:46:07,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945416414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:46:07,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:46:07,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:46:07,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566028608] [2024-11-07 03:46:07,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:46:07,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:46:07,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:46:07,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:46:07,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:46:07,209 INFO L87 Difference]: Start difference. First operand 77 states and 111 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:46:07,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:46:07,238 INFO L93 Difference]: Finished difference Result 126 states and 181 transitions. [2024-11-07 03:46:07,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:46:07,239 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-07 03:46:07,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:46:07,239 INFO L225 Difference]: With dead ends: 126 [2024-11-07 03:46:07,240 INFO L226 Difference]: Without dead ends: 79 [2024-11-07 03:46:07,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:46:07,240 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:46:07,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 311 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:46:07,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-07 03:46:07,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-07 03:46:07,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 78 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:46:07,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 113 transitions. [2024-11-07 03:46:07,244 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 113 transitions. Word has length 30 [2024-11-07 03:46:07,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:46:07,245 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 113 transitions. [2024-11-07 03:46:07,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:46:07,245 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 113 transitions. [2024-11-07 03:46:07,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-07 03:46:07,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:46:07,247 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 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 03:46:07,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 03:46:07,248 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:46:07,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:46:07,249 INFO L85 PathProgramCache]: Analyzing trace with hash 297391685, now seen corresponding path program 1 times [2024-11-07 03:46:07,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:46:07,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660042611] [2024-11-07 03:46:07,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:46:07,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:46:07,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:46:07,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 03:46:07,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:46:07,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660042611] [2024-11-07 03:46:07,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660042611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:46:07,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:46:07,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 03:46:07,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856436375] [2024-11-07 03:46:07,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:46:07,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 03:46:07,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:46:07,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 03:46:07,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 03:46:07,531 INFO L87 Difference]: Start difference. First operand 79 states and 113 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:46:07,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:46:07,611 INFO L93 Difference]: Finished difference Result 132 states and 188 transitions. [2024-11-07 03:46:07,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 03:46:07,611 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-07 03:46:07,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:46:07,612 INFO L225 Difference]: With dead ends: 132 [2024-11-07 03:46:07,612 INFO L226 Difference]: Without dead ends: 83 [2024-11-07 03:46:07,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 03:46:07,613 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 94 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:46:07,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 375 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:46:07,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-07 03:46:07,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2024-11-07 03:46:07,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 81 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:46:07,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 116 transitions. [2024-11-07 03:46:07,621 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 116 transitions. Word has length 31 [2024-11-07 03:46:07,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:46:07,621 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 116 transitions. [2024-11-07 03:46:07,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:46:07,621 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 116 transitions. [2024-11-07 03:46:07,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-07 03:46:07,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:46:07,621 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 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 03:46:07,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 03:46:07,622 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:46:07,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:46:07,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1538094600, now seen corresponding path program 1 times [2024-11-07 03:46:07,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:46:07,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735903585] [2024-11-07 03:46:07,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:46:07,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:46:07,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:46:07,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 03:46:07,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:46:07,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735903585] [2024-11-07 03:46:07,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735903585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:46:07,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:46:07,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 03:46:07,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347767153] [2024-11-07 03:46:07,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:46:07,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 03:46:07,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:46:07,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 03:46:07,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 03:46:07,947 INFO L87 Difference]: Start difference. First operand 82 states and 116 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:46:08,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:46:08,023 INFO L93 Difference]: Finished difference Result 138 states and 194 transitions. [2024-11-07 03:46:08,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 03:46:08,024 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-07 03:46:08,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:46:08,024 INFO L225 Difference]: With dead ends: 138 [2024-11-07 03:46:08,025 INFO L226 Difference]: Without dead ends: 86 [2024-11-07 03:46:08,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-07 03:46:08,026 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 87 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:46:08,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 477 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:46:08,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-07 03:46:08,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2024-11-07 03:46:08,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 81 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:46:08,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 116 transitions. [2024-11-07 03:46:08,033 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 116 transitions. Word has length 32 [2024-11-07 03:46:08,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:46:08,033 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 116 transitions. [2024-11-07 03:46:08,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:46:08,033 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 116 transitions. [2024-11-07 03:46:08,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-07 03:46:08,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:46:08,034 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 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 03:46:08,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 03:46:08,034 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:46:08,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:46:08,034 INFO L85 PathProgramCache]: Analyzing trace with hash -2101214396, now seen corresponding path program 1 times [2024-11-07 03:46:08,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:46:08,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851320227] [2024-11-07 03:46:08,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:46:08,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:46:08,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 03:46:08,077 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 03:46:08,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 03:46:08,128 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 03:46:08,128 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 03:46:08,129 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 03:46:08,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 03:46:08,132 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-07 03:46:08,161 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 03:46:08,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 03:46:08 BoogieIcfgContainer [2024-11-07 03:46:08,165 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 03:46:08,166 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 03:46:08,168 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 03:46:08,168 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 03:46:08,168 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:46:06" (3/4) ... [2024-11-07 03:46:08,170 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 03:46:08,171 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 03:46:08,171 INFO L158 Benchmark]: Toolchain (without parser) took 2577.68ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 91.5MB in the beginning and 61.3MB in the end (delta: 30.1MB). Peak memory consumption was 69.0MB. Max. memory is 16.1GB. [2024-11-07 03:46:08,171 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 117.4MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:46:08,172 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.80ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 75.1MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 03:46:08,173 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.35ms. Allocated memory is still 117.4MB. Free memory was 75.1MB in the beginning and 67.8MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 03:46:08,173 INFO L158 Benchmark]: Boogie Preprocessor took 62.65ms. Allocated memory is still 117.4MB. Free memory was 67.8MB in the beginning and 63.1MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:46:08,173 INFO L158 Benchmark]: RCFGBuilder took 504.64ms. Allocated memory is still 117.4MB. Free memory was 63.1MB in the beginning and 65.5MB in the end (delta: -2.4MB). Peak memory consumption was 31.9MB. Max. memory is 16.1GB. [2024-11-07 03:46:08,173 INFO L158 Benchmark]: TraceAbstraction took 1721.62ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 64.5MB in the beginning and 61.4MB in the end (delta: 3.2MB). Peak memory consumption was 45.5MB. Max. memory is 16.1GB. [2024-11-07 03:46:08,173 INFO L158 Benchmark]: Witness Printer took 4.59ms. Allocated memory is still 159.4MB. Free memory was 61.4MB in the beginning and 61.3MB in the end (delta: 37.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:46:08,174 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.35ms. Allocated memory is still 117.4MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 225.80ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 75.1MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.35ms. Allocated memory is still 117.4MB. Free memory was 75.1MB in the beginning and 67.8MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.65ms. Allocated memory is still 117.4MB. Free memory was 67.8MB in the beginning and 63.1MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 504.64ms. Allocated memory is still 117.4MB. Free memory was 63.1MB in the beginning and 65.5MB in the end (delta: -2.4MB). Peak memory consumption was 31.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1721.62ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 64.5MB in the beginning and 61.4MB in the end (delta: 3.2MB). Peak memory consumption was 45.5MB. Max. memory is 16.1GB. * Witness Printer took 4.59ms. Allocated memory is still 159.4MB. Free memory was 61.4MB in the beginning and 61.3MB in the end (delta: 37.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: 21]: 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 bitwiseAnd at line 141. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 8); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (8 - 1); [L32] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 32); [L33] const SORT_10 msb_SORT_10 = (SORT_10)1 << (32 - 1); [L35] const SORT_31 mask_SORT_31 = (SORT_31)-1 >> (sizeof(SORT_31) * 8 - 4); [L36] const SORT_31 msb_SORT_31 = (SORT_31)1 << (4 - 1); [L38] const SORT_67 mask_SORT_67 = (SORT_67)-1 >> (sizeof(SORT_67) * 8 - 10); [L39] const SORT_67 msb_SORT_67 = (SORT_67)1 << (10 - 1); [L41] const SORT_1 var_7 = 0; [L42] const SORT_10 var_12 = 0; [L43] const SORT_1 var_21 = 1; [L45] SORT_1 input_2; [L46] SORT_3 input_4; [L47] SORT_1 input_5; [L48] SORT_1 input_6; [L49] SORT_1 input_29; [L50] SORT_31 input_32; [L51] SORT_31 input_34; [L52] SORT_1 input_36; [L53] SORT_1 input_38; [L54] SORT_1 input_42; [L55] SORT_1 input_44; [L56] SORT_1 input_46; [L57] SORT_1 input_48; [L58] SORT_3 input_50; [L59] SORT_1 input_53; [L60] SORT_1 input_55; [L61] SORT_1 input_59; [L62] SORT_1 input_63; [L63] SORT_1 input_65; [L64] SORT_67 input_68; [L65] SORT_1 input_70; [L66] SORT_1 input_72; [L67] SORT_1 input_78; [L68] SORT_1 input_85; [L69] SORT_1 input_91; [L71] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, var_12=0, var_21=1, var_7=0] [L71] SORT_1 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L72] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, var_12=0, var_21=1, var_7=0] [L72] SORT_1 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L73] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, var_12=0, var_21=1, var_7=0] [L73] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L74] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, var_12=0, var_21=1, var_7=0] [L74] SORT_1 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L75] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, var_12=0, var_21=1, var_7=0] [L75] SORT_1 state_40 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L76] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, var_12=0, var_21=1, var_7=0] [L76] SORT_1 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, var_12=0, var_21=1, var_7=0] [L77] SORT_1 state_61 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L79] SORT_1 init_9_arg_1 = var_7; [L80] state_8 = init_9_arg_1 [L81] SORT_1 init_15_arg_1 = var_7; [L82] state_14 = init_15_arg_1 [L83] SORT_1 init_26_arg_1 = var_7; [L84] state_25 = init_26_arg_1 [L85] SORT_1 init_28_arg_1 = var_7; [L86] state_27 = init_28_arg_1 [L87] SORT_1 init_41_arg_1 = var_7; [L88] state_40 = init_41_arg_1 [L89] SORT_1 init_58_arg_1 = var_7; [L90] state_57 = init_58_arg_1 [L91] SORT_1 init_62_arg_1 = var_7; [L92] state_61 = init_62_arg_1 VAL [mask_SORT_1=1, state_14=0, state_25=0, state_27=0, state_40=0, state_57=0, state_61=0, state_8=0, var_12=0, var_21=1, var_7=0] [L95] input_2 = __VERIFIER_nondet_uchar() [L96] input_4 = __VERIFIER_nondet_uchar() [L97] input_5 = __VERIFIER_nondet_uchar() [L98] input_6 = __VERIFIER_nondet_uchar() [L99] input_29 = __VERIFIER_nondet_uchar() [L100] input_32 = __VERIFIER_nondet_uchar() [L101] input_34 = __VERIFIER_nondet_uchar() [L102] input_36 = __VERIFIER_nondet_uchar() [L103] input_38 = __VERIFIER_nondet_uchar() [L104] input_42 = __VERIFIER_nondet_uchar() [L105] input_44 = __VERIFIER_nondet_uchar() [L106] input_46 = __VERIFIER_nondet_uchar() [L107] input_48 = __VERIFIER_nondet_uchar() [L108] input_50 = __VERIFIER_nondet_uchar() [L109] input_53 = __VERIFIER_nondet_uchar() [L110] input_55 = __VERIFIER_nondet_uchar() [L111] input_59 = __VERIFIER_nondet_uchar() [L112] input_63 = __VERIFIER_nondet_uchar() [L113] input_65 = __VERIFIER_nondet_uchar() [L114] input_68 = __VERIFIER_nondet_ushort() [L115] input_70 = __VERIFIER_nondet_uchar() [L116] input_72 = __VERIFIER_nondet_uchar() [L117] input_78 = __VERIFIER_nondet_uchar() [L118] input_85 = __VERIFIER_nondet_uchar() [L119] input_91 = __VERIFIER_nondet_uchar() [L122] SORT_1 var_11_arg_0 = state_8; VAL [mask_SORT_1=1, state_14=0, state_25=0, state_27=0, state_40=0, state_57=0, state_61=0, state_8=0, var_11_arg_0=0, var_12=0, var_21=1, var_7=0] [L123] EXPR var_11_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, state_14=0, state_25=0, state_27=0, state_40=0, state_57=0, state_61=0, state_8=0, var_12=0, var_21=1, var_7=0] [L123] var_11_arg_0 = var_11_arg_0 & mask_SORT_1 [L124] SORT_10 var_11 = var_11_arg_0; [L125] SORT_10 var_13_arg_0 = var_11; [L126] SORT_10 var_13_arg_1 = var_12; [L127] SORT_1 var_13 = var_13_arg_0 == var_13_arg_1; [L128] SORT_1 var_16_arg_0 = state_14; VAL [mask_SORT_1=1, state_14=0, state_25=0, state_27=0, state_40=0, state_57=0, state_61=0, state_8=0, var_12=0, var_13=1, var_16_arg_0=0, var_21=1, var_7=0] [L129] EXPR var_16_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, state_14=0, state_25=0, state_27=0, state_40=0, state_57=0, state_61=0, state_8=0, var_12=0, var_13=1, var_21=1, var_7=0] [L129] var_16_arg_0 = var_16_arg_0 & mask_SORT_1 [L130] SORT_10 var_16 = var_16_arg_0; [L131] SORT_10 var_17_arg_0 = var_16; [L132] SORT_10 var_17_arg_1 = var_12; [L133] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L134] SORT_1 var_18_arg_0 = var_13; [L135] SORT_1 var_18_arg_1 = var_17; VAL [mask_SORT_1=1, state_14=0, state_25=0, state_27=0, state_40=0, state_57=0, state_61=0, state_8=0, var_12=0, var_18_arg_0=1, var_18_arg_1=1, var_21=1, var_7=0] [L136] EXPR var_18_arg_0 | var_18_arg_1 VAL [mask_SORT_1=1, state_14=0, state_25=0, state_27=0, state_40=0, state_57=0, state_61=0, state_8=0, var_12=0, var_21=1, var_7=0] [L136] SORT_1 var_18 = var_18_arg_0 | var_18_arg_1; [L137] SORT_1 var_22_arg_0 = var_18; [L138] SORT_1 var_22 = ~var_22_arg_0; [L139] SORT_1 var_23_arg_0 = var_21; [L140] SORT_1 var_23_arg_1 = var_22; VAL [mask_SORT_1=1, state_14=0, state_25=0, state_27=0, state_40=0, state_57=0, state_61=0, state_8=0, var_12=0, var_21=1, var_23_arg_0=1, var_23_arg_1=-2, var_7=0] [L141] EXPR var_23_arg_0 & var_23_arg_1 VAL [mask_SORT_1=1, state_14=0, state_25=0, state_27=0, state_40=0, state_57=0, state_61=0, state_8=0, var_12=0, var_21=1, var_7=0] [L141] SORT_1 var_23 = var_23_arg_0 & var_23_arg_1; [L142] EXPR var_23 & mask_SORT_1 VAL [mask_SORT_1=1, state_14=0, state_25=0, state_27=0, state_40=0, state_57=0, state_61=0, state_8=0, var_12=0, var_21=1, var_7=0] [L142] var_23 = var_23 & mask_SORT_1 [L143] SORT_1 bad_24_arg_0 = var_23; [L144] CALL __VERIFIER_assert(!(bad_24_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 181 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 181 mSDsluCounter, 1478 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1069 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 158 IncrementalHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 409 mSDtfsCounter, 158 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=3, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 154 NumberOfCodeBlocks, 154 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 118 ConstructedInterpolants, 0 QuantifiedInterpolants, 294 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 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 03:46:08,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p08.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 3888704d5a955b45281a90f2156d0109c7e11fdda93c54cd78435365c9c632be --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 03:46:09,944 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 03:46:10,024 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-07 03:46:10,029 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 03:46:10,029 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 03:46:10,050 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 03:46:10,051 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 03:46:10,051 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 03:46:10,051 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 03:46:10,052 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 03:46:10,052 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 03:46:10,052 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 03:46:10,052 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 03:46:10,052 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 03:46:10,053 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 03:46:10,053 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 03:46:10,053 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 03:46:10,053 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 03:46:10,053 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 03:46:10,053 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 03:46:10,053 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 03:46:10,053 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 03:46:10,053 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 03:46:10,053 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 03:46:10,053 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 03:46:10,053 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 03:46:10,053 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 03:46:10,054 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 03:46:10,054 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 03:46:10,054 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 03:46:10,054 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 03:46:10,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:46:10,054 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 03:46:10,054 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 03:46:10,054 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 03:46:10,054 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 03:46:10,055 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 03:46:10,055 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 03:46:10,055 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 03:46:10,055 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 03:46:10,055 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 03:46:10,055 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3888704d5a955b45281a90f2156d0109c7e11fdda93c54cd78435365c9c632be [2024-11-07 03:46:10,305 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 03:46:10,313 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 03:46:10,314 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 03:46:10,315 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 03:46:10,315 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 03:46:10,315 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p08.c [2024-11-07 03:46:11,465 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 03:46:11,664 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 03:46:11,668 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p08.c [2024-11-07 03:46:11,678 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/66b3006e5/e383bd0e0c7348fcabed7a9775538bdc/FLAG2a4873e82 [2024-11-07 03:46:12,029 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/66b3006e5/e383bd0e0c7348fcabed7a9775538bdc [2024-11-07 03:46:12,031 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 03:46:12,032 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 03:46:12,033 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 03:46:12,033 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 03:46:12,036 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 03:46:12,036 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:46:12" (1/1) ... [2024-11-07 03:46:12,037 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6546a1f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:12, skipping insertion in model container [2024-11-07 03:46:12,037 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:46:12" (1/1) ... [2024-11-07 03:46:12,053 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 03:46:12,142 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p08.c[1266,1279] [2024-11-07 03:46:12,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:46:12,198 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 03:46:12,206 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/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p08.c[1266,1279] [2024-11-07 03:46:12,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:46:12,257 INFO L204 MainTranslator]: Completed translation [2024-11-07 03:46:12,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:12 WrapperNode [2024-11-07 03:46:12,257 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 03:46:12,258 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 03:46:12,258 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 03:46:12,258 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 03:46:12,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:12" (1/1) ... [2024-11-07 03:46:12,275 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:12" (1/1) ... [2024-11-07 03:46:12,301 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 277 [2024-11-07 03:46:12,302 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 03:46:12,302 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 03:46:12,302 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 03:46:12,302 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 03:46:12,308 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:12" (1/1) ... [2024-11-07 03:46:12,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:12" (1/1) ... [2024-11-07 03:46:12,314 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:12" (1/1) ... [2024-11-07 03:46:12,327 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 03:46:12,328 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:12" (1/1) ... [2024-11-07 03:46:12,328 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:12" (1/1) ... [2024-11-07 03:46:12,333 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:12" (1/1) ... [2024-11-07 03:46:12,338 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:12" (1/1) ... [2024-11-07 03:46:12,340 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:12" (1/1) ... [2024-11-07 03:46:12,340 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:12" (1/1) ... [2024-11-07 03:46:12,342 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 03:46:12,343 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 03:46:12,343 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 03:46:12,343 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 03:46:12,344 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:12" (1/1) ... [2024-11-07 03:46:12,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:46:12,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 03:46:12,371 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 03:46:12,376 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 03:46:12,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 03:46:12,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 03:46:12,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 03:46:12,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 03:46:12,496 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 03:46:12,497 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 03:46:12,684 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2024-11-07 03:46:12,684 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 03:46:12,691 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 03:46:12,692 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 03:46:12,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:46:12 BoogieIcfgContainer [2024-11-07 03:46:12,693 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 03:46:12,695 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 03:46:12,695 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 03:46:12,699 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 03:46:12,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:46:12" (1/3) ... [2024-11-07 03:46:12,699 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16bb8345 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:46:12, skipping insertion in model container [2024-11-07 03:46:12,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:12" (2/3) ... [2024-11-07 03:46:12,699 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16bb8345 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:46:12, skipping insertion in model container [2024-11-07 03:46:12,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:46:12" (3/3) ... [2024-11-07 03:46:12,700 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p08.c [2024-11-07 03:46:12,711 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 03:46:12,711 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 03:46:12,744 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 03:46:12,753 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;@10daace5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 03:46:12,753 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 03:46:12,759 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:46:12,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-07 03:46:12,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:46:12,763 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 03:46:12,763 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:46:12,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:46:12,766 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-07 03:46:12,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:46:12,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1387543255] [2024-11-07 03:46:12,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:46:12,773 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 03:46:12,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:46:12,775 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 03:46:12,776 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 03:46:12,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:46:12,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-07 03:46:12,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 03:46:13,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 03:46:13,030 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 03:46:13,032 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 03:46:13,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1387543255] [2024-11-07 03:46:13,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1387543255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:46:13,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:46:13,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:46:13,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726116116] [2024-11-07 03:46:13,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:46:13,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:46:13,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 03:46:13,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:46:13,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:46:13,067 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:46:13,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:46:13,103 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-07 03:46:13,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:46:13,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-07 03:46:13,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:46:13,109 INFO L225 Difference]: With dead ends: 18 [2024-11-07 03:46:13,109 INFO L226 Difference]: Without dead ends: 10 [2024-11-07 03:46:13,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 03:46:13,114 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:46:13,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:46:13,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-07 03:46:13,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-07 03:46:13,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:46:13,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-07 03:46:13,133 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-07 03:46:13,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:46:13,133 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-07 03:46:13,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:46:13,133 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-07 03:46:13,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-07 03:46:13,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:46:13,134 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-07 03:46:13,138 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 03:46:13,337 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 03:46:13,338 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:46:13,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:46:13,339 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-07 03:46:13,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:46:13,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1106774224] [2024-11-07 03:46:13,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:46:13,340 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 03:46:13,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:46:13,343 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 03:46:13,344 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 03:46:13,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:46:13,435 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-07 03:46:13,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 03:46:13,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 03:46:13,588 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 03:46:14,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 03:46:14,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 03:46:14,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1106774224] [2024-11-07 03:46:14,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1106774224] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 03:46:14,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 03:46:14,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-07 03:46:14,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28988932] [2024-11-07 03:46:14,453 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 03:46:14,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 03:46:14,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 03:46:14,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 03:46:14,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-07 03:46:14,455 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:46:14,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:46:14,511 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2024-11-07 03:46:14,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 03:46:14,512 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-07 03:46:14,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:46:14,512 INFO L225 Difference]: With dead ends: 15 [2024-11-07 03:46:14,512 INFO L226 Difference]: Without dead ends: 13 [2024-11-07 03:46:14,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-07 03:46:14,513 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:46:14,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 14 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:46:14,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-07 03:46:14,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2024-11-07 03:46:14,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:46:14,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-07 03:46:14,517 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2024-11-07 03:46:14,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:46:14,517 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-07 03:46:14,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:46:14,517 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-07 03:46:14,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-07 03:46:14,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:46:14,517 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-07 03:46:14,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-07 03:46:14,718 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 03:46:14,718 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:46:14,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:46:14,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2024-11-07 03:46:14,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:46:14,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [133553897] [2024-11-07 03:46:14,719 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 03:46:14,719 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 03:46:14,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:46:14,721 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 03:46:14,722 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 03:46:14,849 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 03:46:14,849 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 03:46:14,852 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-07 03:46:14,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 03:46:15,018 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 03:46:15,018 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 03:46:18,667 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 03:46:18,668 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 03:46:18,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [133553897] [2024-11-07 03:46:18,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [133553897] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 03:46:18,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 03:46:18,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-07 03:46:18,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746189909] [2024-11-07 03:46:18,668 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 03:46:18,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 03:46:18,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 03:46:18,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 03:46:18,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-07 03:46:18,669 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:46:18,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:46:18,754 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2024-11-07 03:46:18,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 03:46:18,755 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-07 03:46:18,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:46:18,755 INFO L225 Difference]: With dead ends: 18 [2024-11-07 03:46:18,755 INFO L226 Difference]: Without dead ends: 16 [2024-11-07 03:46:18,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-07 03:46:18,756 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:46:18,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 24 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:46:18,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-07 03:46:18,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2024-11-07 03:46:18,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:46:18,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-11-07 03:46:18,758 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2024-11-07 03:46:18,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:46:18,758 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-11-07 03:46:18,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:46:18,759 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-11-07 03:46:18,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-07 03:46:18,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:46:18,759 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2024-11-07 03:46:18,762 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 03:46:18,959 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 03:46:18,959 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:46:18,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:46:18,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1333570723, now seen corresponding path program 3 times [2024-11-07 03:46:18,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:46:18,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1798482382] [2024-11-07 03:46:18,961 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-07 03:46:18,961 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 03:46:18,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:46:18,963 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 03:46:18,964 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 03:46:19,049 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-07 03:46:19,049 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 03:46:19,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-07 03:46:19,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 03:46:19,215 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-07 03:46:19,215 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 03:46:20,636 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-07 03:46:20,636 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 03:46:20,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1798482382] [2024-11-07 03:46:20,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1798482382] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 03:46:20,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 03:46:20,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-07 03:46:20,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508420876] [2024-11-07 03:46:20,636 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 03:46:20,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 03:46:20,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 03:46:20,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 03:46:20,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 03:46:20,637 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:46:20,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:46:20,674 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2024-11-07 03:46:20,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:46:20,676 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-07 03:46:20,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:46:20,676 INFO L225 Difference]: With dead ends: 15 [2024-11-07 03:46:20,676 INFO L226 Difference]: Without dead ends: 0 [2024-11-07 03:46:20,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-07 03:46:20,677 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 4 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:46:20,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 7 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:46:20,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-07 03:46:20,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-07 03:46:20,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:46:20,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-07 03:46:20,677 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2024-11-07 03:46:20,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:46:20,678 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 03:46:20,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:46:20,678 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-07 03:46:20,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-07 03:46:20,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 03:46:20,684 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 (5)] Ended with exit code 0 [2024-11-07 03:46:20,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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 03:46:20,884 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1] [2024-11-07 03:46:20,886 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-07 03:46:20,942 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 03:46:20,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 03:46:20 BoogieIcfgContainer [2024-11-07 03:46:20,951 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 03:46:20,952 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 03:46:20,952 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 03:46:20,952 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 03:46:20,952 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:46:12" (3/4) ... [2024-11-07 03:46:20,954 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 03:46:20,959 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-07 03:46:20,960 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-07 03:46:20,960 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-07 03:46:20,960 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 03:46:21,027 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 03:46:21,027 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 03:46:21,027 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 03:46:21,028 INFO L158 Benchmark]: Toolchain (without parser) took 8996.09ms. Allocated memory was 83.9MB in the beginning and 436.2MB in the end (delta: 352.3MB). Free memory was 60.7MB in the beginning and 190.1MB in the end (delta: -129.4MB). Peak memory consumption was 218.1MB. Max. memory is 16.1GB. [2024-11-07 03:46:21,028 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 83.9MB. Free memory is still 65.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:46:21,028 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.09ms. Allocated memory is still 83.9MB. Free memory was 60.4MB in the beginning and 44.9MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 03:46:21,029 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.48ms. Allocated memory is still 83.9MB. Free memory was 44.9MB in the beginning and 42.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:46:21,029 INFO L158 Benchmark]: Boogie Preprocessor took 40.12ms. Allocated memory is still 83.9MB. Free memory was 42.7MB in the beginning and 40.1MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:46:21,029 INFO L158 Benchmark]: RCFGBuilder took 350.38ms. Allocated memory is still 83.9MB. Free memory was 40.1MB in the beginning and 56.4MB in the end (delta: -16.3MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. [2024-11-07 03:46:21,030 INFO L158 Benchmark]: TraceAbstraction took 8256.29ms. Allocated memory was 83.9MB in the beginning and 436.2MB in the end (delta: 352.3MB). Free memory was 55.9MB in the beginning and 198.4MB in the end (delta: -142.6MB). Peak memory consumption was 213.6MB. Max. memory is 16.1GB. [2024-11-07 03:46:21,030 INFO L158 Benchmark]: Witness Printer took 75.51ms. Allocated memory is still 436.2MB. Free memory was 198.4MB in the beginning and 190.1MB in the end (delta: 8.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:46:21,031 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.14ms. Allocated memory is still 83.9MB. Free memory is still 65.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 225.09ms. Allocated memory is still 83.9MB. Free memory was 60.4MB in the beginning and 44.9MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.48ms. Allocated memory is still 83.9MB. Free memory was 44.9MB in the beginning and 42.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.12ms. Allocated memory is still 83.9MB. Free memory was 42.7MB in the beginning and 40.1MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 350.38ms. Allocated memory is still 83.9MB. Free memory was 40.1MB in the beginning and 56.4MB in the end (delta: -16.3MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. * TraceAbstraction took 8256.29ms. Allocated memory was 83.9MB in the beginning and 436.2MB in the end (delta: 352.3MB). Free memory was 55.9MB in the beginning and 198.4MB in the end (delta: -142.6MB). Peak memory consumption was 213.6MB. Max. memory is 16.1GB. * Witness Printer took 75.51ms. Allocated memory is still 436.2MB. Free memory was 198.4MB in the beginning and 190.1MB in the end (delta: 8.3MB). 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 - PositiveResult [Line: 21]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.1s, OverallIterations: 4, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12 mSDsluCounter, 56 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 42 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 52 IncrementalHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 14 mSDtfsCounter, 52 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=3, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 38 NumberOfCodeBlocks, 32 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 64 ConstructedInterpolants, 22 QuantifiedInterpolants, 14934 SizeOfPredicates, 31 NumberOfNonLiveVariables, 364 ConjunctsInSsa, 101 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 18/48 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: (((((0 == var_7) && (0 == state_8)) && (0 == var_12)) && (1 == mask_SORT_1)) || ((((0 == var_7) && (0 == state_14)) && (0 == var_12)) && (1 == mask_SORT_1))) RESULT: Ultimate proved your program to be correct! [2024-11-07 03:46:21,054 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 Writing output log to file Ultimate.log Result: TRUE