./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-59.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 b5a3a78de85206c06265f4a5f6df62e7897a8d9c53ab2b455732af1ef22c4599 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:55:43,986 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:55:44,054 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 21:55:44,060 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:55:44,060 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:55:44,077 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:55:44,078 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:55:44,078 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:55:44,079 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:55:44,079 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:55:44,079 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:55:44,080 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:55:44,080 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:55:44,080 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:55:44,081 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:55:44,081 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:55:44,081 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:55:44,082 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:55:44,082 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 21:55:44,083 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:55:44,083 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:55:44,086 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:55:44,086 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:55:44,086 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:55:44,087 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:55:44,087 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:55:44,087 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:55:44,087 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:55:44,088 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:55:44,088 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:55:44,088 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:55:44,088 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:55:44,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:55:44,089 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:55:44,089 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:55:44,089 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:55:44,089 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 21:55:44,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 21:55:44,090 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:55:44,090 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:55:44,090 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:55:44,091 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:55:44,091 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/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 -> b5a3a78de85206c06265f4a5f6df62e7897a8d9c53ab2b455732af1ef22c4599 [2024-11-08 21:55:44,301 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:55:44,336 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:55:44,342 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:55:44,343 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:55:44,344 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:55:44,345 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-59.i [2024-11-08 21:55:45,724 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:55:45,928 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:55:45,929 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-59.i [2024-11-08 21:55:45,938 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da4ff604b/086b7fbd6c914e8699a732ad2332d4f0/FLAGf16820c4c [2024-11-08 21:55:46,295 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da4ff604b/086b7fbd6c914e8699a732ad2332d4f0 [2024-11-08 21:55:46,297 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:55:46,299 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:55:46,301 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:55:46,301 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:55:46,306 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:55:46,307 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:55:46" (1/1) ... [2024-11-08 21:55:46,307 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20e94ad8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:55:46, skipping insertion in model container [2024-11-08 21:55:46,308 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:55:46" (1/1) ... [2024-11-08 21:55:46,333 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:55:46,458 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-59.i[919,932] [2024-11-08 21:55:46,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:55:46,526 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:55:46,536 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-59.i[919,932] [2024-11-08 21:55:46,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:55:46,585 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:55:46,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:55:46 WrapperNode [2024-11-08 21:55:46,585 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:55:46,586 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:55:46,586 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:55:46,586 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:55:46,591 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:55:46" (1/1) ... [2024-11-08 21:55:46,608 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:55:46" (1/1) ... [2024-11-08 21:55:46,673 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 242 [2024-11-08 21:55:46,674 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:55:46,677 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:55:46,681 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:55:46,681 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:55:46,691 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:55:46" (1/1) ... [2024-11-08 21:55:46,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:55:46" (1/1) ... [2024-11-08 21:55:46,713 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:55:46" (1/1) ... [2024-11-08 21:55:46,728 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-08 21:55:46,728 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:55:46" (1/1) ... [2024-11-08 21:55:46,728 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:55:46" (1/1) ... [2024-11-08 21:55:46,740 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:55:46" (1/1) ... [2024-11-08 21:55:46,743 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:55:46" (1/1) ... [2024-11-08 21:55:46,746 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:55:46" (1/1) ... [2024-11-08 21:55:46,752 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:55:46" (1/1) ... [2024-11-08 21:55:46,760 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:55:46,761 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:55:46,761 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:55:46,761 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:55:46,762 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:55:46" (1/1) ... [2024-11-08 21:55:46,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:55:46,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:55:46,812 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 21:55:46,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 21:55:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:55:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:55:46,853 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:55:46,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 21:55:46,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:55:46,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:55:46,944 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:55:46,948 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:55:47,330 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-08 21:55:47,331 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:55:47,342 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:55:47,342 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:55:47,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:55:47 BoogieIcfgContainer [2024-11-08 21:55:47,342 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:55:47,344 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:55:47,344 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:55:47,347 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:55:47,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:55:46" (1/3) ... [2024-11-08 21:55:47,348 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2602d114 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:55:47, skipping insertion in model container [2024-11-08 21:55:47,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:55:46" (2/3) ... [2024-11-08 21:55:47,348 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2602d114 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:55:47, skipping insertion in model container [2024-11-08 21:55:47,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:55:47" (3/3) ... [2024-11-08 21:55:47,350 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-59.i [2024-11-08 21:55:47,364 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:55:47,365 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:55:47,416 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:55:47,421 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;@6fa2ea2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:55:47,421 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:55:47,425 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 68 states have (on average 1.4558823529411764) internal successors, (99), 69 states have internal predecessors, (99), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 21:55:47,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-08 21:55:47,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:55:47,445 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:55:47,446 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:55:47,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:55:47,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1149651611, now seen corresponding path program 1 times [2024-11-08 21:55:47,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:55:47,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409505905] [2024-11-08 21:55:47,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:55:47,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:55:47,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:47,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:55:47,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:47,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:55:47,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:47,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 21:55:47,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:47,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:55:47,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:47,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 21:55:47,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:47,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:55:47,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:47,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 21:55:47,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:47,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:55:47,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:47,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:55:47,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:47,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 21:55:47,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:47,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:55:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:47,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:55:47,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:47,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:55:47,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:47,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:55:47,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:47,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:55:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:47,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:55:47,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:47,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 21:55:47,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:47,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:55:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:47,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:55:47,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:47,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:55:47,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:47,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:55:47,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:47,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:55:47,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:47,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:55:47,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:47,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:55:47,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:47,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:55:47,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:47,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:55:47,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:47,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 21:55:47,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:47,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:55:47,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:47,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 21:55:47,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:47,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:55:47,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:47,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 21:55:47,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:47,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 21:55:47,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:47,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-08 21:55:47,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:47,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 21:55:47,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:47,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-08 21:55:47,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:55:47,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409505905] [2024-11-08 21:55:47,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409505905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:55:47,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:55:47,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:55:47,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254894534] [2024-11-08 21:55:47,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:55:47,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 21:55:47,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:55:47,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 21:55:47,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:55:47,956 INFO L87 Difference]: Start difference. First operand has 105 states, 68 states have (on average 1.4558823529411764) internal successors, (99), 69 states have internal predecessors, (99), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-08 21:55:47,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:55:47,993 INFO L93 Difference]: Finished difference Result 203 states and 362 transitions. [2024-11-08 21:55:47,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 21:55:47,995 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 216 [2024-11-08 21:55:47,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:55:48,001 INFO L225 Difference]: With dead ends: 203 [2024-11-08 21:55:48,002 INFO L226 Difference]: Without dead ends: 101 [2024-11-08 21:55:48,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:55:48,010 INFO L432 NwaCegarLoop]: 159 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, 159 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:55:48,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:55:48,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-08 21:55:48,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-08 21:55:48,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 65 states have (on average 1.4) internal successors, (91), 65 states have internal predecessors, (91), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 21:55:48,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 159 transitions. [2024-11-08 21:55:48,069 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 159 transitions. Word has length 216 [2024-11-08 21:55:48,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:55:48,072 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 159 transitions. [2024-11-08 21:55:48,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-08 21:55:48,072 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 159 transitions. [2024-11-08 21:55:48,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-08 21:55:48,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:55:48,078 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:55:48,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 21:55:48,078 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:55:48,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:55:48,079 INFO L85 PathProgramCache]: Analyzing trace with hash -539743827, now seen corresponding path program 1 times [2024-11-08 21:55:48,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:55:48,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318917335] [2024-11-08 21:55:48,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:55:48,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:55:48,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:48,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:55:48,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:48,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:55:48,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:48,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 21:55:48,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:48,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:55:48,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:48,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 21:55:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:48,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:55:48,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:48,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 21:55:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:48,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:55:48,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:48,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:55:48,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:48,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 21:55:48,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:48,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:55:48,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:48,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:55:48,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:48,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:55:48,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:48,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:55:48,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:48,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:55:48,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:48,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:55:48,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:48,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 21:55:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:48,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:55:48,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:48,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:55:48,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:48,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:55:48,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:48,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:55:48,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:48,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:55:48,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:48,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:55:48,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:48,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:55:48,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:48,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:55:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:48,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:55:48,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:48,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 21:55:48,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:48,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:55:48,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:48,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 21:55:48,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:48,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:55:48,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:48,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 21:55:48,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:48,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 21:55:48,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:48,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-08 21:55:48,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:48,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 21:55:48,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:48,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-08 21:55:48,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:55:48,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318917335] [2024-11-08 21:55:48,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318917335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:55:48,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:55:48,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:55:48,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824139206] [2024-11-08 21:55:48,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:55:48,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:55:48,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:55:48,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:55:48,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:55:48,799 INFO L87 Difference]: Start difference. First operand 101 states and 159 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-08 21:55:49,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:55:49,063 INFO L93 Difference]: Finished difference Result 298 states and 472 transitions. [2024-11-08 21:55:49,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 21:55:49,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 216 [2024-11-08 21:55:49,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:55:49,067 INFO L225 Difference]: With dead ends: 298 [2024-11-08 21:55:49,067 INFO L226 Difference]: Without dead ends: 200 [2024-11-08 21:55:49,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 71 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-08 21:55:49,069 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 118 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 21:55:49,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 461 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 21:55:49,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-08 21:55:49,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 161. [2024-11-08 21:55:49,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 90 states have (on average 1.288888888888889) internal successors, (116), 90 states have internal predecessors, (116), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-08 21:55:49,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 252 transitions. [2024-11-08 21:55:49,092 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 252 transitions. Word has length 216 [2024-11-08 21:55:49,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:55:49,093 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 252 transitions. [2024-11-08 21:55:49,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-08 21:55:49,094 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 252 transitions. [2024-11-08 21:55:49,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-08 21:55:49,096 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:55:49,096 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:55:49,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 21:55:49,096 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:55:49,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:55:49,097 INFO L85 PathProgramCache]: Analyzing trace with hash 292548804, now seen corresponding path program 1 times [2024-11-08 21:55:49,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:55:49,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061594564] [2024-11-08 21:55:49,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:55:49,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:55:49,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:49,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:55:49,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:49,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:55:49,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:49,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 21:55:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:49,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:55:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:49,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 21:55:49,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:49,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:55:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:49,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 21:55:49,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:49,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:55:49,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:49,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:55:49,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:49,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 21:55:49,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:49,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:55:49,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:49,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:55:49,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:49,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:55:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:49,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:55:49,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:49,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:55:49,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:49,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:55:49,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:49,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 21:55:49,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:49,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:55:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:49,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:55:49,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:49,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:55:49,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:49,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:55:49,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:49,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:55:49,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:49,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:55:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:49,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:55:49,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:49,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:55:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:49,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:55:49,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:49,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 21:55:49,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:49,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:55:49,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:49,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 21:55:49,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:49,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:55:49,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:49,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 21:55:49,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:49,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 21:55:49,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:49,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-08 21:55:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:49,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 21:55:49,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:49,557 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-08 21:55:49,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:55:49,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061594564] [2024-11-08 21:55:49,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061594564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:55:49,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:55:49,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:55:49,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211751236] [2024-11-08 21:55:49,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:55:49,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:55:49,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:55:49,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:55:49,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:55:49,560 INFO L87 Difference]: Start difference. First operand 161 states and 252 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-08 21:55:49,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:55:49,730 INFO L93 Difference]: Finished difference Result 367 states and 576 transitions. [2024-11-08 21:55:49,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 21:55:49,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 217 [2024-11-08 21:55:49,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:55:49,735 INFO L225 Difference]: With dead ends: 367 [2024-11-08 21:55:49,736 INFO L226 Difference]: Without dead ends: 269 [2024-11-08 21:55:49,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 71 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-08 21:55:49,737 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 137 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:55:49,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 459 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 21:55:49,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-08 21:55:49,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 257. [2024-11-08 21:55:49,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 151 states have (on average 1.3311258278145695) internal successors, (201), 151 states have internal predecessors, (201), 102 states have call successors, (102), 3 states have call predecessors, (102), 3 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-08 21:55:49,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 405 transitions. [2024-11-08 21:55:49,776 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 405 transitions. Word has length 217 [2024-11-08 21:55:49,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:55:49,778 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 405 transitions. [2024-11-08 21:55:49,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-08 21:55:49,779 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 405 transitions. [2024-11-08 21:55:49,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-08 21:55:49,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:55:49,785 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:55:49,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 21:55:49,785 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:55:49,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:55:49,785 INFO L85 PathProgramCache]: Analyzing trace with hash 97854282, now seen corresponding path program 1 times [2024-11-08 21:55:49,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:55:49,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167961445] [2024-11-08 21:55:49,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:55:49,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:55:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 21:55:49,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1734707509] [2024-11-08 21:55:49,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:55:49,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:55:49,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:55:49,977 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 21:55:49,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 21:55:50,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:55:50,249 INFO L255 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-08 21:55:50,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:55:52,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 429 proven. 405 refuted. 0 times theorem prover too weak. 1410 trivial. 0 not checked. [2024-11-08 21:55:52,799 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:56:12,163 WARN L286 SmtUtils]: Spent 10.47s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 21:56:21,959 WARN L286 SmtUtils]: Spent 6.66s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 21:56:28,282 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (mod c_~var_1_4~0 256))) (let ((.cse2 (div (mod c_~var_1_6~0 65536) .cse7)) (.cse4 (mod c_~var_1_19~0 4294967296))) (let ((.cse0 (mod (+ .cse7 c_~var_1_7~0) 65536)) (.cse1 (+ .cse4 1)) (.cse6 (mod |c_ULTIMATE.start_step_~stepLocal_2~0#1| 65536)) (.cse5 (+ (mod c_~var_1_7~0 65536) .cse7 1)) (.cse3 (mod (* c_~var_1_19~0 .cse2) 4294967296))) (and (or (< .cse0 .cse1) (not (= (mod (* .cse2 .cse0) 4294967296) .cse0))) (or (not (= .cse3 .cse0)) (< .cse4 .cse0)) (forall ((v_z_5 Int)) (or (< v_z_5 .cse5) (not (= v_z_5 (mod (* v_z_5 .cse2) 4294967296))) (< .cse6 v_z_5) (< v_z_5 .cse1))) (or (< .cse6 .cse3) (< .cse3 .cse5) (< .cse4 .cse3)))))) is different from false [2024-11-08 21:56:37,030 WARN L286 SmtUtils]: Spent 8.69s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 21:56:43,491 WARN L286 SmtUtils]: Spent 6.46s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 21:57:00,230 WARN L286 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)