./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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/nla-digbench-scaling/fermat1-ll_unwindbound1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a4e999359b895f3090fa3a0a394d4e8b87ebbe801b1ab5ed9c028edec94c7c83 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:19:48,280 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:19:48,320 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:19:48,323 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:19:48,324 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:19:48,338 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:19:48,338 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:19:48,338 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:19:48,340 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:19:48,340 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:19:48,340 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:19:48,340 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:19:48,340 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:19:48,340 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:19:48,340 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:19:48,340 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:19:48,340 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:19:48,340 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:19:48,340 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:19:48,340 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:19:48,340 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:19:48,341 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:19:48,341 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:19:48,341 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:19:48,341 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:19:48,341 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:19:48,341 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:19:48,341 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:19:48,341 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:19:48,341 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:19:48,341 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:19:48,341 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:19:48,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:19:48,341 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:19:48,341 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:19:48,341 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:19:48,341 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:19:48,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:19:48,341 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:19:48,341 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:19:48,341 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:19:48,342 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:19:48,342 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:19:48,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:19:48,342 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:19:48,342 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:19:48,342 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:19:48,342 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:19:48,342 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a4e999359b895f3090fa3a0a394d4e8b87ebbe801b1ab5ed9c028edec94c7c83 [2025-01-09 03:19:48,546 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:19:48,551 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:19:48,554 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:19:48,554 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:19:48,555 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:19:48,555 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound1.c [2025-01-09 03:19:49,666 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b2a9440f0/8e5880eefb7f4b69bfad9c286cd5086f/FLAGf3405150a [2025-01-09 03:19:49,857 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:19:49,858 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound1.c [2025-01-09 03:19:49,863 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b2a9440f0/8e5880eefb7f4b69bfad9c286cd5086f/FLAGf3405150a [2025-01-09 03:19:50,228 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b2a9440f0/8e5880eefb7f4b69bfad9c286cd5086f [2025-01-09 03:19:50,229 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:19:50,230 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:19:50,231 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:19:50,232 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:19:50,234 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:19:50,235 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:19:50" (1/1) ... [2025-01-09 03:19:50,235 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@608424ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:19:50, skipping insertion in model container [2025-01-09 03:19:50,236 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:19:50" (1/1) ... [2025-01-09 03:19:50,244 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:19:50,334 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/nla-digbench-scaling/fermat1-ll_unwindbound1.c[535,548] [2025-01-09 03:19:50,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:19:50,354 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:19:50,360 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/nla-digbench-scaling/fermat1-ll_unwindbound1.c[535,548] [2025-01-09 03:19:50,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:19:50,381 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:19:50,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:19:50 WrapperNode [2025-01-09 03:19:50,383 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:19:50,383 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:19:50,384 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:19:50,384 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:19:50,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:19:50" (1/1) ... [2025-01-09 03:19:50,392 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:19:50" (1/1) ... [2025-01-09 03:19:50,401 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 65 [2025-01-09 03:19:50,401 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:19:50,402 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:19:50,402 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:19:50,402 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:19:50,408 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:19:50" (1/1) ... [2025-01-09 03:19:50,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:19:50" (1/1) ... [2025-01-09 03:19:50,409 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:19:50" (1/1) ... [2025-01-09 03:19:50,415 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]. [2025-01-09 03:19:50,415 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:19:50" (1/1) ... [2025-01-09 03:19:50,415 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:19:50" (1/1) ... [2025-01-09 03:19:50,417 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:19:50" (1/1) ... [2025-01-09 03:19:50,421 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:19:50" (1/1) ... [2025-01-09 03:19:50,423 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:19:50" (1/1) ... [2025-01-09 03:19:50,424 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:19:50" (1/1) ... [2025-01-09 03:19:50,424 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:19:50" (1/1) ... [2025-01-09 03:19:50,426 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:19:50,426 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:19:50,426 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:19:50,426 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:19:50,430 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:19:50" (1/1) ... [2025-01-09 03:19:50,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:19:50,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:19:50,451 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) [2025-01-09 03:19:50,456 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 [2025-01-09 03:19:50,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:19:50,469 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 03:19:50,469 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 03:19:50,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:19:50,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:19:50,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:19:50,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 03:19:50,470 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 03:19:50,505 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:19:50,507 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:19:50,643 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-01-09 03:19:50,644 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:19:50,650 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:19:50,650 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-09 03:19:50,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:19:50 BoogieIcfgContainer [2025-01-09 03:19:50,651 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:19:50,652 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:19:50,653 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:19:50,656 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:19:50,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:19:50" (1/3) ... [2025-01-09 03:19:50,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d809135 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:19:50, skipping insertion in model container [2025-01-09 03:19:50,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:19:50" (2/3) ... [2025-01-09 03:19:50,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d809135 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:19:50, skipping insertion in model container [2025-01-09 03:19:50,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:19:50" (3/3) ... [2025-01-09 03:19:50,658 INFO L128 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound1.c [2025-01-09 03:19:50,670 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:19:50,671 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fermat1-ll_unwindbound1.c that has 3 procedures, 32 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-01-09 03:19:50,714 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:19:50,723 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;@1f74c3ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:19:50,725 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:19:50,728 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 03:19:50,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-09 03:19:50,734 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:19:50,734 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:19:50,735 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:19:50,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:19:50,738 INFO L85 PathProgramCache]: Analyzing trace with hash 738208203, now seen corresponding path program 1 times [2025-01-09 03:19:50,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:19:50,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929823731] [2025-01-09 03:19:50,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:19:50,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:19:50,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 03:19:50,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 03:19:50,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:19:50,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:19:50,840 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 03:19:50,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:19:50,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929823731] [2025-01-09 03:19:50,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929823731] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:19:50,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572293700] [2025-01-09 03:19:50,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:19:50,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:19:50,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:19:50,844 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:19:50,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 03:19:50,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 03:19:50,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 03:19:50,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:19:50,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:19:50,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 03:19:50,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:19:50,910 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 03:19:50,910 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:19:50,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572293700] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:19:50,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:19:50,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 03:19:50,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482744834] [2025-01-09 03:19:50,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:19:50,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 03:19:50,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:19:50,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 03:19:50,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 03:19:50,932 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 03:19:50,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:19:50,948 INFO L93 Difference]: Finished difference Result 61 states and 94 transitions. [2025-01-09 03:19:50,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 03:19:50,949 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2025-01-09 03:19:50,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:19:50,953 INFO L225 Difference]: With dead ends: 61 [2025-01-09 03:19:50,953 INFO L226 Difference]: Without dead ends: 28 [2025-01-09 03:19:50,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 03:19:50,959 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:19:50,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:19:50,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-01-09 03:19:50,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-01-09 03:19:50,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 03:19:50,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2025-01-09 03:19:50,985 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 18 [2025-01-09 03:19:50,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:19:50,986 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2025-01-09 03:19:50,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 03:19:50,987 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2025-01-09 03:19:50,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 03:19:50,988 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:19:50,988 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:19:50,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 03:19:51,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 03:19:51,190 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:19:51,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:19:51,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1800491340, now seen corresponding path program 1 times [2025-01-09 03:19:51,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:19:51,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148485330] [2025-01-09 03:19:51,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:19:51,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:19:51,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 03:19:51,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 03:19:51,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:19:51,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:19:51,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1231641270] [2025-01-09 03:19:51,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:19:51,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:19:51,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:19:51,241 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:19:51,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 03:19:51,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 03:19:51,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 03:19:51,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:19:51,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:19:51,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 03:19:51,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:19:51,486 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 03:19:51,487 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:19:51,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:19:51,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148485330] [2025-01-09 03:19:51,488 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:19:51,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231641270] [2025-01-09 03:19:51,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231641270] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:19:51,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:19:51,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:19:51,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097345353] [2025-01-09 03:19:51,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:19:51,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:19:51,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:19:51,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:19:51,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:19:51,490 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 03:19:52,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:19:52,520 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2025-01-09 03:19:52,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:19:52,520 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2025-01-09 03:19:52,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:19:52,521 INFO L225 Difference]: With dead ends: 47 [2025-01-09 03:19:52,521 INFO L226 Difference]: Without dead ends: 45 [2025-01-09 03:19:52,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:19:52,522 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 13 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:19:52,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 101 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 03:19:52,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-01-09 03:19:52,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2025-01-09 03:19:52,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 32 states have internal predecessors, (44), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 03:19:52,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 61 transitions. [2025-01-09 03:19:52,532 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 61 transitions. Word has length 19 [2025-01-09 03:19:52,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:19:52,532 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 61 transitions. [2025-01-09 03:19:52,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 03:19:52,532 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 61 transitions. [2025-01-09 03:19:52,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 03:19:52,533 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:19:52,533 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:19:52,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 03:19:52,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:19:52,737 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:19:52,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:19:52,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1798465552, now seen corresponding path program 1 times [2025-01-09 03:19:52,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:19:52,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170539157] [2025-01-09 03:19:52,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:19:52,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:19:52,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 03:19:52,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 03:19:52,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:19:52,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:19:52,802 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 03:19:52,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:19:52,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170539157] [2025-01-09 03:19:52,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170539157] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:19:52,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:19:52,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:19:52,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317594666] [2025-01-09 03:19:52,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:19:52,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:19:52,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:19:52,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:19:52,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:19:52,803 INFO L87 Difference]: Start difference. First operand 44 states and 61 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 03:19:52,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:19:52,820 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2025-01-09 03:19:52,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:19:52,820 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2025-01-09 03:19:52,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:19:52,821 INFO L225 Difference]: With dead ends: 53 [2025-01-09 03:19:52,821 INFO L226 Difference]: Without dead ends: 46 [2025-01-09 03:19:52,821 INFO L434 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 [2025-01-09 03:19:52,822 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 5 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:19:52,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 91 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:19:52,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-01-09 03:19:52,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-01-09 03:19:52,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 33 states have (on average 1.393939393939394) internal successors, (46), 34 states have internal predecessors, (46), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 03:19:52,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2025-01-09 03:19:52,842 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 19 [2025-01-09 03:19:52,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:19:52,842 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2025-01-09 03:19:52,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 03:19:52,842 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2025-01-09 03:19:52,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 03:19:52,844 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:19:52,844 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:19:52,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 03:19:52,844 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:19:52,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:19:52,845 INFO L85 PathProgramCache]: Analyzing trace with hash 884762201, now seen corresponding path program 1 times [2025-01-09 03:19:52,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:19:52,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991707363] [2025-01-09 03:19:52,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:19:52,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:19:52,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 03:19:52,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 03:19:52,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:19:52,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:19:53,099 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 03:19:53,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:19:53,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991707363] [2025-01-09 03:19:53,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991707363] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:19:53,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207198633] [2025-01-09 03:19:53,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:19:53,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:19:53,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:19:53,102 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:19:53,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 03:19:53,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 03:19:53,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 03:19:53,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:19:53,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:19:53,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 03:19:53,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:19:53,202 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 03:19:53,202 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:19:53,303 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 03:19:53,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207198633] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:19:53,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:19:53,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 12 [2025-01-09 03:19:53,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035733065] [2025-01-09 03:19:53,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:19:53,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 03:19:53,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:19:53,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 03:19:53,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-01-09 03:19:53,304 INFO L87 Difference]: Start difference. First operand 46 states and 63 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 03:19:53,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:19:53,401 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2025-01-09 03:19:53,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:19:53,402 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) Word has length 25 [2025-01-09 03:19:53,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:19:53,403 INFO L225 Difference]: With dead ends: 53 [2025-01-09 03:19:53,403 INFO L226 Difference]: Without dead ends: 48 [2025-01-09 03:19:53,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-01-09 03:19:53,405 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:19:53,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 133 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:19:53,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-01-09 03:19:53,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 32. [2025-01-09 03:19:53,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 03:19:53,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2025-01-09 03:19:53,422 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 25 [2025-01-09 03:19:53,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:19:53,422 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2025-01-09 03:19:53,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 03:19:53,422 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2025-01-09 03:19:53,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-09 03:19:53,423 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:19:53,423 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:19:53,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 03:19:53,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:19:53,627 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:19:53,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:19:53,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1887642954, now seen corresponding path program 1 times [2025-01-09 03:19:53,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:19:53,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634742881] [2025-01-09 03:19:53,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:19:53,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:19:53,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 03:19:53,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 03:19:53,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:19:53,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:19:53,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [843095521] [2025-01-09 03:19:53,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:19:53,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:19:53,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:19:53,654 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:19:53,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 03:19:53,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 03:19:53,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 03:19:53,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:19:53,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 03:19:53,693 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 03:19:53,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 03:19:53,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 03:19:53,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:19:53,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 03:19:53,713 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 03:19:53,714 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 03:19:53,714 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 03:19:53,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 03:19:53,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:19:53,918 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-09 03:19:53,933 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 03:19:53,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:19:53 BoogieIcfgContainer [2025-01-09 03:19:53,935 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 03:19:53,935 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 03:19:53,935 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 03:19:53,935 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 03:19:53,938 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:19:50" (3/4) ... [2025-01-09 03:19:53,939 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 03:19:53,965 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 17. [2025-01-09 03:19:54,007 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 03:19:54,007 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 03:19:54,007 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 03:19:54,008 INFO L158 Benchmark]: Toolchain (without parser) took 3777.26ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 39.5MB in the end (delta: 83.4MB). Peak memory consumption was 80.0MB. Max. memory is 16.1GB. [2025-01-09 03:19:54,008 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 03:19:54,008 INFO L158 Benchmark]: CACSL2BoogieTranslator took 151.71ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 111.2MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 03:19:54,008 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.10ms. Allocated memory is still 167.8MB. Free memory was 111.2MB in the beginning and 110.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 03:19:54,008 INFO L158 Benchmark]: Boogie Preprocessor took 23.84ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 108.6MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 03:19:54,008 INFO L158 Benchmark]: RCFGBuilder took 224.51ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 96.0MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 03:19:54,008 INFO L158 Benchmark]: TraceAbstraction took 3282.35ms. Allocated memory is still 167.8MB. Free memory was 95.3MB in the beginning and 46.0MB in the end (delta: 49.2MB). Peak memory consumption was 54.8MB. Max. memory is 16.1GB. [2025-01-09 03:19:54,009 INFO L158 Benchmark]: Witness Printer took 71.88ms. Allocated memory is still 167.8MB. Free memory was 46.0MB in the beginning and 39.5MB in the end (delta: 6.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 03:19:54,011 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 151.71ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 111.2MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.10ms. Allocated memory is still 167.8MB. Free memory was 111.2MB in the beginning and 110.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.84ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 108.6MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 224.51ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 96.0MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3282.35ms. Allocated memory is still 167.8MB. Free memory was 95.3MB in the beginning and 46.0MB in the end (delta: 49.2MB). Peak memory consumption was 54.8MB. Max. memory is 16.1GB. * Witness Printer took 71.88ms. Allocated memory is still 167.8MB. Free memory was 46.0MB in the beginning and 39.5MB in the end (delta: 6.6MB). 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 - CounterExampleResult [Line: 14]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int counter = 0; VAL [counter=0] [L21] int A, R; [L22] long long u, v, r; [L23] A = __VERIFIER_nondet_int() [L24] R = __VERIFIER_nondet_int() [L25] CALL assume_abort_if_not((((long long) R - 1) * ((long long) R - 1)) < A) VAL [\old(cond)=1, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L25] RET assume_abort_if_not((((long long) R - 1) * ((long long) R - 1)) < A) VAL [A=15, R=4, counter=0] [L27] CALL assume_abort_if_not(A % 2 == 1) VAL [\old(cond)=1, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L27] RET assume_abort_if_not(A % 2 == 1) VAL [A=15, R=4, counter=0] [L29] u = ((long long) 2 * R) + 1 [L30] v = 1 [L31] r = ((long long) R * R) - A VAL [A=15, counter=0, r=1, u=9, v=1] [L34] EXPR counter++ VAL [A=15, counter=1, r=1, u=9, v=1] [L34] COND TRUE counter++<1 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=1] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=15, counter=1, r=1, u=9, v=1] [L36] COND FALSE !(!(r != 0)) VAL [A=15, counter=1, r=1, u=9, v=1] [L39] EXPR counter++ VAL [A=15, counter=2, r=1, u=9, v=1] [L39] COND FALSE !(counter++<1) [L47] EXPR counter++ VAL [A=15, counter=3, r=1, u=9, v=1] [L47] COND FALSE !(counter++<1) [L34] EXPR counter++ VAL [A=15, counter=4, r=1, u=9, v=1] [L34] COND FALSE !(counter++<1) [L56] CALL __VERIFIER_assert(((long long) 4*A) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=0, counter=4] [L12] COND TRUE !(cond) VAL [\old(cond)=0, counter=4] [L14] reach_error() VAL [\old(cond)=0, counter=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 39 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 34 mSDsluCounter, 366 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 238 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 127 IncrementalHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 128 mSDtfsCounter, 127 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=3, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 17 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 205 NumberOfCodeBlocks, 205 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 142 ConstructedInterpolants, 0 QuantifiedInterpolants, 465 SizeOfPredicates, 2 NumberOfNonLiveVariables, 202 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 29/34 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-09 03:19:54,035 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE