./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-46.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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-ci_file-46.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 985b50a0b8eeadb0f849d937466c4ec1e5f58df88650cbc5b820e0f210728055 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 03:22:29,333 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 03:22:29,417 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 03:22:29,422 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 03:22:29,424 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 03:22:29,446 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 03:22:29,447 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 03:22:29,447 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 03:22:29,448 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 03:22:29,448 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 03:22:29,449 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 03:22:29,449 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 03:22:29,450 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 03:22:29,450 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 03:22:29,451 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 03:22:29,451 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 03:22:29,451 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 03:22:29,452 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 03:22:29,452 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 03:22:29,452 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 03:22:29,452 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 03:22:29,453 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 03:22:29,453 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 03:22:29,454 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 03:22:29,454 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 03:22:29,454 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 03:22:29,455 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 03:22:29,455 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 03:22:29,455 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 03:22:29,456 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 03:22:29,456 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 03:22:29,456 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 03:22:29,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:22:29,457 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 03:22:29,457 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 03:22:29,457 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 03:22:29,458 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 03:22:29,458 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 03:22:29,458 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 03:22:29,458 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 03:22:29,459 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 03:22:29,459 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 03:22:29,459 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 -> 985b50a0b8eeadb0f849d937466c4ec1e5f58df88650cbc5b820e0f210728055 [2024-11-12 03:22:29,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 03:22:29,745 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 03:22:29,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 03:22:29,750 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 03:22:29,750 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 03:22:29,751 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-ci_file-46.i [2024-11-12 03:22:31,265 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 03:22:31,495 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 03:22:31,496 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-46.i [2024-11-12 03:22:31,509 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1262bda62/56d406ba62804636869736a30e623542/FLAGcae617ed8 [2024-11-12 03:22:31,846 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1262bda62/56d406ba62804636869736a30e623542 [2024-11-12 03:22:31,849 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 03:22:31,850 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 03:22:31,851 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 03:22:31,852 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 03:22:31,858 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 03:22:31,859 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:22:31" (1/1) ... [2024-11-12 03:22:31,860 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6015f64b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:22:31, skipping insertion in model container [2024-11-12 03:22:31,860 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:22:31" (1/1) ... [2024-11-12 03:22:31,894 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 03:22:32,063 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-ci_file-46.i[919,932] [2024-11-12 03:22:32,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:22:32,148 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 03:22:32,160 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-ci_file-46.i[919,932] [2024-11-12 03:22:32,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:22:32,219 INFO L204 MainTranslator]: Completed translation [2024-11-12 03:22:32,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:22:32 WrapperNode [2024-11-12 03:22:32,220 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 03:22:32,221 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 03:22:32,222 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 03:22:32,224 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 03:22:32,232 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:22:32" (1/1) ... [2024-11-12 03:22:32,244 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:22:32" (1/1) ... [2024-11-12 03:22:32,334 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 221 [2024-11-12 03:22:32,338 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 03:22:32,339 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 03:22:32,339 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 03:22:32,339 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 03:22:32,357 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:22:32" (1/1) ... [2024-11-12 03:22:32,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:22:32" (1/1) ... [2024-11-12 03:22:32,385 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:22:32" (1/1) ... [2024-11-12 03:22:32,417 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-12 03:22:32,421 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:22:32" (1/1) ... [2024-11-12 03:22:32,421 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:22:32" (1/1) ... [2024-11-12 03:22:32,443 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:22:32" (1/1) ... [2024-11-12 03:22:32,448 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:22:32" (1/1) ... [2024-11-12 03:22:32,456 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:22:32" (1/1) ... [2024-11-12 03:22:32,459 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:22:32" (1/1) ... [2024-11-12 03:22:32,468 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 03:22:32,470 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 03:22:32,470 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 03:22:32,470 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 03:22:32,471 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:22:32" (1/1) ... [2024-11-12 03:22:32,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:22:32,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:22:32,509 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-12 03:22:32,515 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-12 03:22:32,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 03:22:32,558 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 03:22:32,558 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 03:22:32,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 03:22:32,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 03:22:32,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 03:22:32,633 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 03:22:32,635 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 03:22:33,141 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-12 03:22:33,142 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 03:22:33,161 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 03:22:33,161 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 03:22:33,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:22:33 BoogieIcfgContainer [2024-11-12 03:22:33,162 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 03:22:33,164 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 03:22:33,165 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 03:22:33,168 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 03:22:33,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 03:22:31" (1/3) ... [2024-11-12 03:22:33,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb5c2d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:22:33, skipping insertion in model container [2024-11-12 03:22:33,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:22:32" (2/3) ... [2024-11-12 03:22:33,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb5c2d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:22:33, skipping insertion in model container [2024-11-12 03:22:33,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:22:33" (3/3) ... [2024-11-12 03:22:33,172 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-46.i [2024-11-12 03:22:33,190 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 03:22:33,190 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 03:22:33,246 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 03:22:33,260 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;@2e0c4b3c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 03:22:33,260 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 03:22:33,264 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 65 states have (on average 1.476923076923077) internal successors, (96), 66 states have internal predecessors, (96), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-12 03:22:33,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-12 03:22:33,277 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:22:33,278 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:22:33,279 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:22:33,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:22:33,284 INFO L85 PathProgramCache]: Analyzing trace with hash -305731500, now seen corresponding path program 1 times [2024-11-12 03:22:33,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:22:33,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057223882] [2024-11-12 03:22:33,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:22:33,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:22:33,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:22:33,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:22:33,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:22:33,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:22:33,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:22:33,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:22:33,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:22:33,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:22:33,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:22:33,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:22:33,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:22:33,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:22:33,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:22:33,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:22:33,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:22:33,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 03:22:33,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:22:33,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:22:33,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:22:33,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 03:22:33,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:22:33,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 03:22:33,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:22:33,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 03:22:33,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:22:33,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 03:22:33,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:22:33,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 03:22:33,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:22:33,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 03:22:33,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:22:33,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 03:22:33,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:22:33,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 03:22:33,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:22:33,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 03:22:33,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:22:33,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 03:22:33,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:22:33,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 03:22:33,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:22:33,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 03:22:33,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:22:33,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 03:22:33,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:22:33,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 03:22:33,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:22:33,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-12 03:22:33,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:22:33,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057223882] [2024-11-12 03:22:33,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057223882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:22:33,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:22:33,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 03:22:33,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500267526] [2024-11-12 03:22:33,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:22:33,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 03:22:33,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:22:33,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 03:22:33,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 03:22:33,906 INFO L87 Difference]: Start difference. First operand has 91 states, 65 states have (on average 1.476923076923077) internal successors, (96), 66 states have internal predecessors, (96), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-12 03:22:33,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:22:33,944 INFO L93 Difference]: Finished difference Result 175 states and 301 transitions. [2024-11-12 03:22:33,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 03:22:33,946 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 153 [2024-11-12 03:22:33,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:22:33,954 INFO L225 Difference]: With dead ends: 175 [2024-11-12 03:22:33,954 INFO L226 Difference]: Without dead ends: 87 [2024-11-12 03:22:33,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 48 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-12 03:22:33,961 INFO L435 NwaCegarLoop]: 134 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, 134 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-12 03:22:33,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 03:22:33,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-12 03:22:34,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-12 03:22:34,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 62 states have internal predecessors, (88), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-12 03:22:34,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 134 transitions. [2024-11-12 03:22:34,015 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 134 transitions. Word has length 153 [2024-11-12 03:22:34,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:22:34,017 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 134 transitions. [2024-11-12 03:22:34,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-12 03:22:34,017 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 134 transitions. [2024-11-12 03:22:34,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-12 03:22:34,021 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:22:34,021 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:22:34,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 03:22:34,022 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:22:34,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:22:34,025 INFO L85 PathProgramCache]: Analyzing trace with hash -701696279, now seen corresponding path program 1 times [2024-11-12 03:22:34,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:22:34,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119074241] [2024-11-12 03:22:34,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:22:34,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:22:34,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:01,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:23:01,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:01,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:23:01,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:01,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:23:01,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:01,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:23:01,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:01,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:23:01,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:01,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:23:01,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:01,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:23:01,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:01,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 03:23:01,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:01,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:23:01,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:01,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 03:23:01,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:01,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 03:23:01,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:01,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 03:23:01,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:01,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 03:23:01,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:01,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 03:23:01,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:01,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 03:23:01,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:01,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 03:23:01,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:01,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 03:23:01,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:01,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 03:23:01,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:01,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 03:23:01,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:01,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 03:23:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:01,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 03:23:01,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:01,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 03:23:01,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:01,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 03:23:01,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:01,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-12 03:23:01,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:23:01,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119074241] [2024-11-12 03:23:01,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119074241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:23:01,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:23:01,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 03:23:01,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491748049] [2024-11-12 03:23:01,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:23:01,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 03:23:01,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:23:01,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 03:23:01,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-12 03:23:01,148 INFO L87 Difference]: Start difference. First operand 87 states and 134 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-12 03:23:05,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-12 03:23:12,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:23:12,516 INFO L93 Difference]: Finished difference Result 292 states and 444 transitions. [2024-11-12 03:23:12,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 03:23:12,517 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 154 [2024-11-12 03:23:12,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:23:12,521 INFO L225 Difference]: With dead ends: 292 [2024-11-12 03:23:12,521 INFO L226 Difference]: Without dead ends: 208 [2024-11-12 03:23:12,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-11-12 03:23:12,524 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 183 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2024-11-12 03:23:12,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 615 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 9.3s Time] [2024-11-12 03:23:12,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-12 03:23:12,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 166. [2024-11-12 03:23:12,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 131 states have (on average 1.4885496183206106) internal successors, (195), 132 states have internal predecessors, (195), 31 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-12 03:23:12,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 257 transitions. [2024-11-12 03:23:12,556 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 257 transitions. Word has length 154 [2024-11-12 03:23:12,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:23:12,557 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 257 transitions. [2024-11-12 03:23:12,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-12 03:23:12,558 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 257 transitions. [2024-11-12 03:23:12,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-12 03:23:12,561 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:23:12,561 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:23:12,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 03:23:12,562 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:23:12,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:23:12,563 INFO L85 PathProgramCache]: Analyzing trace with hash -278994453, now seen corresponding path program 1 times [2024-11-12 03:23:12,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:23:12,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795676306] [2024-11-12 03:23:12,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:23:12,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:23:12,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:13,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:23:13,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:13,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:23:13,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:13,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:23:13,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:13,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:23:13,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:13,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:23:13,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:13,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:23:13,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:13,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:23:13,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:13,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 03:23:13,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:13,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:23:13,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:13,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 03:23:13,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:13,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 03:23:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:13,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 03:23:13,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:13,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 03:23:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:13,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 03:23:13,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:13,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 03:23:13,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:13,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 03:23:13,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:13,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 03:23:13,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:13,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 03:23:13,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:13,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 03:23:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:13,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 03:23:13,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:13,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 03:23:13,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:13,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 03:23:13,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:13,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 03:23:13,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:13,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 21 proven. 45 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-12 03:23:13,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:23:13,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795676306] [2024-11-12 03:23:13,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795676306] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 03:23:13,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72378670] [2024-11-12 03:23:13,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:23:13,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:23:13,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:23:13,301 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-12 03:23:13,305 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-12 03:23:13,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:13,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-12 03:23:13,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:23:14,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 462 proven. 96 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2024-11-12 03:23:14,489 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 03:23:15,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72378670] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 03:23:15,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 03:23:15,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 19 [2024-11-12 03:23:15,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587413461] [2024-11-12 03:23:15,184 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 03:23:15,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-12 03:23:15,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:23:15,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-12 03:23:15,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2024-11-12 03:23:15,187 INFO L87 Difference]: Start difference. First operand 166 states and 257 transitions. Second operand has 19 states, 19 states have (on average 4.052631578947368) internal successors, (77), 19 states have internal predecessors, (77), 5 states have call successors, (41), 3 states have call predecessors, (41), 5 states have return successors, (42), 5 states have call predecessors, (42), 5 states have call successors, (42) [2024-11-12 03:23:19,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:23:19,847 INFO L93 Difference]: Finished difference Result 1002 states and 1473 transitions. [2024-11-12 03:23:19,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-11-12 03:23:19,848 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.052631578947368) internal successors, (77), 19 states have internal predecessors, (77), 5 states have call successors, (41), 3 states have call predecessors, (41), 5 states have return successors, (42), 5 states have call predecessors, (42), 5 states have call successors, (42) Word has length 154 [2024-11-12 03:23:19,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:23:19,856 INFO L225 Difference]: With dead ends: 1002 [2024-11-12 03:23:19,858 INFO L226 Difference]: Without dead ends: 839 [2024-11-12 03:23:19,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1011 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1254, Invalid=3716, Unknown=0, NotChecked=0, Total=4970 [2024-11-12 03:23:19,865 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 1269 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 1644 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1270 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 1870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 1644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-12 03:23:19,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1270 Valid, 1098 Invalid, 1870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 1644 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-12 03:23:19,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2024-11-12 03:23:19,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 225. [2024-11-12 03:23:19,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 187 states have (on average 1.4759358288770053) internal successors, (276), 188 states have internal predecessors, (276), 29 states have call successors, (29), 8 states have call predecessors, (29), 8 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-12 03:23:19,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 334 transitions. [2024-11-12 03:23:19,907 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 334 transitions. Word has length 154 [2024-11-12 03:23:19,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:23:19,909 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 334 transitions. [2024-11-12 03:23:19,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.052631578947368) internal successors, (77), 19 states have internal predecessors, (77), 5 states have call successors, (41), 3 states have call predecessors, (41), 5 states have return successors, (42), 5 states have call predecessors, (42), 5 states have call successors, (42) [2024-11-12 03:23:19,909 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 334 transitions. [2024-11-12 03:23:19,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-12 03:23:19,917 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:23:19,917 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:23:19,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 03:23:20,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:23:20,118 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:23:20,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:23:20,119 INFO L85 PathProgramCache]: Analyzing trace with hash 547925480, now seen corresponding path program 1 times [2024-11-12 03:23:20,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:23:20,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067847243] [2024-11-12 03:23:20,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:23:20,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:23:20,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:31,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:23:31,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:31,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:23:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:31,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:23:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:31,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:23:31,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:31,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:23:31,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:31,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:23:31,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:31,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:23:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:31,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 03:23:31,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:31,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:23:31,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:31,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 03:23:31,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:31,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 03:23:31,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:31,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 03:23:31,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:31,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 03:23:31,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:31,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 03:23:31,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:31,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 03:23:31,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:31,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 03:23:31,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:31,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 03:23:31,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:31,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 03:23:31,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:31,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 03:23:31,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:31,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 03:23:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:31,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 03:23:31,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:31,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 03:23:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:31,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 03:23:31,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:31,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-12 03:23:31,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:23:31,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067847243] [2024-11-12 03:23:31,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067847243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:23:31,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:23:31,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-12 03:23:31,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573018024] [2024-11-12 03:23:31,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:23:31,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 03:23:31,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:23:31,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 03:23:31,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-12 03:23:31,273 INFO L87 Difference]: Start difference. First operand 225 states and 334 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-12 03:23:37,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:23:37,249 INFO L93 Difference]: Finished difference Result 600 states and 883 transitions. [2024-11-12 03:23:37,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 03:23:37,251 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 155 [2024-11-12 03:23:37,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:23:37,254 INFO L225 Difference]: With dead ends: 600 [2024-11-12 03:23:37,256 INFO L226 Difference]: Without dead ends: 378 [2024-11-12 03:23:37,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2024-11-12 03:23:37,259 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 750 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 999 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-12 03:23:37,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [750 Valid, 597 Invalid, 1005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 999 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-12 03:23:37,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-11-12 03:23:37,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 251. [2024-11-12 03:23:37,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 213 states have (on average 1.4741784037558685) internal successors, (314), 214 states have internal predecessors, (314), 29 states have call successors, (29), 8 states have call predecessors, (29), 8 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-12 03:23:37,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 372 transitions. [2024-11-12 03:23:37,303 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 372 transitions. Word has length 155 [2024-11-12 03:23:37,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:23:37,305 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 372 transitions. [2024-11-12 03:23:37,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-12 03:23:37,305 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 372 transitions. [2024-11-12 03:23:37,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-12 03:23:37,309 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:23:37,309 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:23:37,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 03:23:37,310 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:23:37,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:23:37,310 INFO L85 PathProgramCache]: Analyzing trace with hash -269722970, now seen corresponding path program 1 times [2024-11-12 03:23:37,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:23:37,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931967523] [2024-11-12 03:23:37,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:23:37,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:23:37,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:46,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:23:46,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:46,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:23:46,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:46,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:23:46,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:46,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:23:46,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:46,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:23:46,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:46,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:23:46,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:46,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:23:46,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:46,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 03:23:46,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:46,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:23:46,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:46,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 03:23:46,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:46,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 03:23:46,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:46,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 03:23:46,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:46,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 03:23:46,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:46,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 03:23:46,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:46,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 03:23:46,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:46,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 03:23:46,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:46,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 03:23:46,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:46,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 03:23:46,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:46,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 03:23:46,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:46,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 03:23:46,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:46,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 03:23:46,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:46,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 03:23:46,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:46,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 03:23:46,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:23:46,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-12 03:23:46,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:23:46,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931967523] [2024-11-12 03:23:46,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931967523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:23:46,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:23:46,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 03:23:46,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199577881] [2024-11-12 03:23:46,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:23:46,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 03:23:46,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:23:46,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 03:23:46,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-12 03:23:46,870 INFO L87 Difference]: Start difference. First operand 251 states and 372 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23)